1 , 1 , 2 , 3 , 5 , 8 , 1 3 , 2 1 , 3 4 , 5 5 , 8 9 , ⋯
The above is the Fibonacci sequence , where F n is the n th Fibonacci number with F 1 = F 2 = 1 .
Without using a calculator , find which answer is equivalent to ( F 1 0 ) 2 − ( F 9 ) 2 .
Hint: Try to find a simpler formula for ( F n + 1 ) 2 − ( F n ) 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.
If we replace n with 2 in the formula given by the hint, then we get ( F 3 ) 2 − ( F 2 ) 2 , which can be simplified to ( 2 ) 2 − ( 1 ) 2 , which is equal to 3 ⋅ 1 .
Replacing n with 3 , we get ( F 4 ) 2 − ( F 3 ) 2 , or 5 ⋅ 1 .
Replacing it with 4 , we get ( F 5 ) 2 − ( F 4 ) 2 , or 8 ⋅ 2 .
Interestingly, all of the numbers we get are Fibonacci numbers multiplied by other Fibonacci numbers. Using this fact, we can continue the pattern without having to do very many calculations:
⎣ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎡ ( F 3 ) 2 − ( F 2 ) 2 ( F 4 ) 2 − ( F 3 ) 2 ( F 5 ) 2 − ( F 4 ) 2 ( F 6 ) 2 − ( F 5 ) 2 ( F 7 ) 2 − ( F 6 ) 2 ( F 8 ) 2 − ( F 7 ) 2 ( F 9 ) 2 − ( F 8 ) 2 ( F 1 0 ) 2 − ( F 9 ) 2 2 2 − 1 2 3 2 − 2 2 5 2 − 3 2 8 2 − 5 2 1 3 2 − 8 2 2 1 2 − 1 3 2 3 4 2 − 2 1 2 5 5 2 − 3 4 2 3 ⋅ 1 5 ⋅ 1 8 ⋅ 2 1 3 ⋅ 3 2 1 ⋅ 5 3 4 ⋅ 8 5 5 ⋅ 1 3 8 9 ⋅ 2 1 ⎦ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎤
F 1 0 = 5 5 , F 9 = 3 4 ⇒ F 1 0 2 − F 9 2 = 3 0 2 5 − 1 1 5 6 = 1 8 6 9 .
The last digit is 9 , so we can just find the last digit is 9.
5 5 × 1 3 2 = 5 5 × 1 6 9 ≡ 5 ( m o d 1 0 )
8 9 × 2 1 ≡ 9 ( m o d 1 0 )
3 4 2 ≡ 6 ( m o d 1 0 )
5 5 × 1 3 ≡ 5 ( m o d 1 0 )
3 4 2 + 1 3 = 1 1 5 6 + 1 3 ≡ 9 ( m o d 1 0 )
3 4 2 + 1 3 2 = 1 1 5 6 + 1 6 9 ≡ 5 ( m o d 1 0 )
5 5 × 2 1 ≡ 5 ( m o d 1 0 )
2 1 2 = 1 ( m o d 1 0 )
So, 8 9 × 2 1 , or 3 4 2 + 1 3 can be the answer.
But, 8 9 × 2 1 = 1 8 6 9 , and 3 4 2 + 1 3 = 1 1 6 9 .
So 8 9 × 2 1 is the answer.
Problem Loading...
Note Loading...
Set Loading...
F n + 1 2 − F n 2 = ( F n + 1 + F n ) ( F n + 1 − F n ) = F n + 2 F n − 1 . Therefore, F 1 0 2 − F 9 2 = F 1 1 F 8 = 8 9 ⋅ 2 1 .