Five students attend today's math circle. They stand in a circle and read out every term in Fibonacci sequence one by one. If they happen to get a term that is a multiple of 3. The student needs to clap once. Starts with Kevin. By the time a student finishes reading term 100, how many times has Kevin clapped his hands?
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.
Consider F n + 4 = F n + 3 + F n + 2 = 2 F n + 2 + F n + 1 = 3 F n + 1 + 2 F n . Therefore F n + 4 is divisible by 3 if F n is divisible by 3. We note that F 0 = 0 is divisible by 3, therefore F 4 is divisible by 3, and so as F 8 , F 1 2 , F 1 6 , . . . . . Note that F 1 , F 2 , and F 3 are not divisible by 3. There F n is a multiple of 3, if and only if n m o d 4 = 0 . Since Kevin's turn is 5 k + 1 , where k is a non-negative integer. Then for Kevin to clap, we must have:
5 k + 1 k + 1 ⟹ k ≡ 0 (mod 4) ≡ 0 (mod 4) ≡ 3 , 7 , 1 1 , . . .
Therefore, Kevin claps when 5 k + 1 = 1 6 , 3 6 , 5 6 , 7 6 , 9 6 for 5 times.