Proove that two Fermat numbers always are relatively prime. I have the lead that F_m | (F_n - 2) for m

Mathematics
- anonymous

Proove that two Fermat numbers always are relatively prime. I have the lead that F_m | (F_n - 2) for m

Mathematics
- Stacey Warren - Expert brainly.com

Hey! We 've verified this expert answer for you, click below to unlock the details :)

- jamiebookeater

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

- anonymous

@myininaya

- anonymous

I've tried to understand the solution here: https://www.artofproblemsolving.com/Wiki/index.php/Fermat_number but don't really understand it.

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

- myininaya

Hey, so from that link the only thing I don't understand so far is why all of that shows that they are relatively prime. I do understand everything else though....
So still thinking as to why it shows they are....

- anonymous

I thinks it has to do with the fact that every Fermat number is odd so can not be divided by two and hence the only gcd is 1

- myininaya

Yeah. lol. I think you are right.

- anonymous

Woho! :)

- anonymous

But who do they get the recursion formula from \[F _{n}=2^{2^{n}}+1\]

- myininaya

The induction part confuses you?

- myininaya

\[F_0=2^{2^0}+1=2^1+1=2+1=3 \]
\[F_1=2^{2^1}+1=2^2+1=4+1=5=3+2 \]
\[F_2=2^{2^2}+1=2^4+1=16+1=17=15+2 =3(5)+2=F_0 \cdot F_1 +2 \]

- anonymous

Wonderful!

- anonymous

So when one have the recursion formula \[F _{n+1}=F _{0}*F _{1}*F _{2}*...*F _{n}+2\]
The solution is to show that the recursion formula is correct using induction, right?

- myininaya

Yes :)

- myininaya

They are proving it :)
Proving that will prove gcd(Fm,Fn)=1

- myininaya

If you need help with the algebra, I can do that.
Right now, I'm multitasking though...so I will help slowly.

- anonymous

So there are two things I don't understand the first is:\[F _{k+1}=2^{2^{k+1}}+1\]
\[=\left( \left( 2^{2^{k}} \right)^{2} +2*2^{2^{k}}+1 \right) - 2*2^{2^{k}}\]

- anonymous

The second thing is \[\gcd(F _{m},F _{n})=\gcd(F _{m},2)\]

- myininaya

\[=2^{2^{k+1}}+1=2^{2^k2^1}+1=2^{2^k 2}+1=(2^{2^k})^2+1\]

- myininaya

They added in a zero.

- anonymous

Why did the add the zero for?

- myininaya

\[=(2^{2^k}+1)^2+1-2 \cdot 2^{2^k} \]
So they can write that one part as Fk

- myininaya

or F_0F_1F_2...F_(K-1)+2

- myininaya

They were setting up for the induction part

- myininaya

\[=(2^{2^k}+1)(2^{2^k}+1)-2^{2^k}\]
Ignore that 1oops

- myininaya

the one in expression i wrote before this one

- myininaya

We are trying to show F_0F_1....F_k+2

- anonymous

Ok I think I get the whole induction proof now.

- anonymous

So seeing that \[F _{k+1}=F _{0}*F _{1}...*F _{k-1}*F _{k}+2\]
How do I know that \[GCD(F _{m},F _{n})=GCD(F _{m},2)\]

- myininaya

Please ask any questions if you have them. I like this proof.

- anonymous

* given that m

- myininaya

Well gcd(odd,2)=1 since odd aren't divisible by 2

- anonymous

Sorry formulated it bad, I mean how do I know that gcd F_n is 2 ?

- myininaya

no Fn is not equal to 2

- anonymous

* F_n is replaces by two *

- anonymous

So where does the replacement of F_n to 2 come from?

- myininaya

gcd(Fm,Fn)
=
gcd(Fm,F0F1...F(n-1)+2)
What about this?

- anonymous

Sorry don't understand, Isn't that equal to f_(n+1)?

- anonymous

Has it to do with the initial lead F_m | (F_n - 2) ?

- myininaya

Well F_(n+1) equals
F0F1....Fn+2
----
Anyways,
Fm|(Fn-2)
=>for some integer k we have k*Fm=Fn-2
=> k*Fm+2=Fn
So gcd(Fm,Fn)
= gcd(Fm, k*Fm+2)
Let gcd(Fm, k*Fm+2)=d
=> for some integers a and b we have
aFm+b(k*Fm+2)=d
Fm(a+bk)+2b=d
But a+bk and b are just integers
We know gcd(Fm,2)=1 since Fm is odd and isn't divisible by 2.
This implies for some integers s and t we have sFm+2t=1
where s above is a+bk and t is b from above.
Did this make it more confusing?

- myininaya

Implies d=1

- anonymous

Not at all, that made perfect sense actually

- anonymous

Will have to put it all together and solve it 2-3 times just to make sure it stays in my brain but you're given me the broad understanding, can't thank you enough!

- myininaya

I try.

- anonymous

Thank you for your patience, have a great evening!

- myininaya

You too. :)

Looking for something else?

Not the answer you are looking for? Search for more explanations.