Math Circle with Kevin

Algebra Level 3

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?


The answer is 5.

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.

2 solutions

Chew-Seong Cheong
Aug 27, 2019

Consider F n + 4 = F n + 3 + F n + 2 = 2 F n + 2 + F n + 1 = 3 F n + 1 + 2 F n F_{n+4} = F_{n+3} + F_{n+2} = 2F_{n+2} + F_{n+1} = 3F_{n+1} + 2F_n . Therefore F n + 4 F_{n+4} is divisible by 3 if F n F_n is divisible by 3. We note that F 0 = 0 F_0 = 0 is divisible by 3, therefore F 4 F_4 is divisible by 3, and so as F 8 , F 12 , F 16 , . . . . F_8, F_{12}, F_{16}, .... . Note that F 1 F_1 , F 2 F_2 , and F 3 F_3 are not divisible by 3. There F n F_n is a multiple of 3, if and only if n m o d 4 = 0 n \bmod 4 = 0 . Since Kevin's turn is 5 k + 1 5k+1 , where k k is a non-negative integer. Then for Kevin to clap, we must have:

5 k + 1 0 (mod 4) k + 1 0 (mod 4) k 3 , 7 , 11 , . . . \begin{aligned} 5k + 1 & \equiv 0 \text{ (mod 4)} \\ k + 1 & \equiv 0 \text{ (mod 4)} \\ \implies k & \equiv 3, 7, 11, ... \end{aligned}

Therefore, Kevin claps when 5 k + 1 = 16 , 36 , 56 , 76 , 96 5k+1 = 16, 36, 56, 76, 96 for 5 \boxed 5 times.

Kevin Xu
Aug 27, 2019
Fibonacci Sequence \quad \quad \quad 1 1 2 3 5 8 13 21 34 ....
Fibonacci Sequence (mod 3 ) 1 1 2 0 2 2 1 0 1 ....

See a trend? ;) \\ So the sequence of "Fibonacci Sequence (mod 3)" repeats every eight terms while having a mutiple of 3 3 every four terms . \\ Since the math circle has five students. 4 × 5 = 20 4 \times 5 = 20 , 100 ÷ 20 = 5 100 \div 20 = 5 , Kevin would clap 5 \boxed{5} times

Additionally you need to show, that for 5 ppl and a periodicity of 4 (for F(n) mod 3 =0), the claps are cycling though the 5ppl in reverse order and thus Kevin actually gets "his" 5claps.

Eric Scholz - 1 year, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...