Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I have a bit difficulty to proofe that two consecutive numbers are coprime. I have the following

The property $P(n)$ is the equation $(F_{n+1},F_n)=1$ where F_i the sequence of fibonacci is and $n \in \mathbb {N}$.

Induction hypothesis: $gcd(F_{n+1},F_n)=1$

$P(0)$ is true because $F_1=1, F_0=1$ and $gcd(1,1)=1$

To show: $gcd(F_{n+2},F_{n+1})=1$

Proof:

Fibonacci formula says

$F_{n+2}=F_{n+1}+F_n$

This is as faar as I got. How can I now get to $gcd(F_{n+2},F_{n+1})=gcd(F_{n+1},F_n)$ which would then proofe it?

share|improve this question

1 Answer 1

up vote 5 down vote accepted

$\gcd(F_{n+1},F_{n+2}) = \gcd(F_{n+1},F_{n+1}+F_n) = \gcd(F_{n+1},F_n)$

By the induction hypothesis $\gcd(F_{n+1},F_n)=1$ so $\gcd(F_{n+1},F_{n+2})=1$

To prove $\gcd(a,b) = \gcd(a,b-a)$ use the fact that if $c\vert a$ and $c\vert b$ then $c\vert na+mb$

share|improve this answer
    
thanks. That makes sense. –  Chris Nov 13 '13 at 13:48
    
+1 for the third line (the two others are already in the question). –  Did Nov 13 '13 at 13:48

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.