Let x = 2 1 + 5 and
x 6 0 0 6 = a 1 x + b 1
x 1 2 3 5 5 = a 2 x + b 2
What is the highest common factor of ( a 1 , b 2 ) ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Wow!... good question.....
Did the same! But I was wondering about the proof of g c d ( F 6 0 0 6 , F 1 2 3 5 4 ) = F g c d ( 6 0 0 6 , 1 2 3 5 4 ) because I didn't know that formula until now. So, I formulated one -
F n = 5 x n − ( x − 5 ) n
Now, we have to find g c d ( F n , F k ) .
Let x − 5 = b , x = a .
We know that ( a k − b k ) ∣ ( a n − b n ) iff k ∣ n .
Hence, proved as now writing the formalities is just trivial.
Log in to reply
A more elementary proof is given here: http://www.cut-the-knot.org/arithmetic/algebra/FibonacciGCD.shtml
x 2 x 2 x − 1 4 x 2 − 4 x + 1 4 x 2 − 4 x x 2 = 2 1 + 5 = 1 + 5 = 5 = 5 = 4 = x + 1
x 3 = x 2 x = ( x + 1 ) x = x 2 + x = ( x + 1 ) + x = 2 x + 1
x 1 x 2 x 3 x n = 1 x + 0 = 1 x + 1 = 2 x + 1 ⋮ = F n x + F n − 1
x 6 0 0 6 = F 6 0 0 6 x + F 6 0 0 5 = a 1 x + b 1
⇒ ( a 1 , b 1 ) = ( F 6 0 0 6 , F 6 0 0 5 )
x 1 2 3 5 5 = F 1 2 3 5 5 x + F 1 2 3 5 4 = a 2 x + b 2
⇒ ( a 2 , b 2 ) = ( F 1 2 3 5 5 , F 1 2 3 5 4 )
{ 6 0 0 6 1 2 3 5 4 = 2 × 3 × 7 × 1 1 × 1 3 = 2 × 3 × 2 9 × 7 1
g cd ( a 1 , b 2 ) = g cd ( F 6 0 0 6 , F 1 2 3 5 4 ) = F g cd ( 6 0 0 6 , 1 2 3 5 4 ) = F 2 × 3 = F 6 = 8
for the highest common factor for x is the golden mean = 8
for the highest common factor for x is the golden mean = 8
Problem Loading...
Note Loading...
Set Loading...
Since x is the Golden Ratio ,
a 1 = F 6 0 0 6
b 2 = F 1 2 3 5 4
Then,
g cd ( a 1 , b 2 )
= g cd ( F 6 0 0 6 , F 1 2 3 5 4 )
= F g c d ( 6 0 0 6 , 1 2 3 5 4 )
= F 6
= 8