Fibonacci numbers are given by the following recursion relation:
⎩ ⎪ ⎨ ⎪ ⎧ F 0 = 0 F 1 = 1 F n = F n − 1 + F n − 2 for n > 1
If the fraction of Fibonacci numbers that are divisible by 7 is given by b a , where a and b are coprime positive integers, what is a + b ?
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.
Interesting question! There are some fascinating divisibility properties in the Fibonacci sequence - every third Fibonacci number is even and every fifth is divisible by 5 , for instance. I'm thinking there's a way to prove by induction that every eighth Fibonacci number is divisible by 7 .
Log in to reply
Ah, there might be... Lemme think about it for a bit...
Problem Loading...
Note Loading...
Set Loading...
If we take the Fibonacci numbers modulo 7 , we get the following series:
0 , 1 , 1 , 2 , 3 , 5 , 1 , 6 , 0 , 6 , 6 , 5 , 4 , 2 , 6 , 1 , 0 , 1 , 1 , 2 , . . .
The series repeats every 1 6 numbers, and every set of 1 6 contains two zeros which represent numbers divisible by 7 .
So, the fraction of Fibonacci numbers divisible by 7 is given by:
1 6 2 = 8 1
1 + 8 = 9