2006 Alabama ARML TST Problems/Problem 8

Revision as of 15:43, 17 April 2008 by 1=2 (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

A bored mathematician has his computer calculate 1000 consecutive terms in the Fibonacci sequence. He notes that the smallest of the numbers is a multiple of 7. How many of the other 999 Fibonacci numbers are multiples of 7?

Solution

We list the Fibonacci numbers mod 7:

1, 1, 2, 3, 5, 1, 6, 0, 6, 6, 5, 4, 2, 6, 1, 0, 1, 1, ....

So the Fibonacci sequence repeats every 16, and for every 8 numbers, there is one 0. $\dfrac{1000}{8}=125$, but we don't count the first one. $\boxed{124}$

See also

2006 Alabama ARML TST (Problems)
Preceded by:
Problem 7
Followed by:
Problem 9
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15