Five girls Alice , Betty , Cathy , Dora , and Emily are sitting around a circle table clockwise. They are playing a game whose rules are as follows:
The first girl yells the number 1 , the second next to the right hand side yells the number 1 , too, from then on, the girl next to the right hand side of the fromer yells the sum of the numbers of the last 2 students.
If the number is divisible by 3 , the girl who yells it needs to clap her hands once.
Given that Alice is the first to yell, how many times should she clap when they have yelled the 1 0 0 th number?
Have a look at my problem set: SAT 1000 problems
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.
The numbers yelled by the five girls are the Fibonacci numbers F n = F n − 1 + F n − 2 : 1 , 1 , 2 , 3 , 5 , . . . \[ \begin{align} F_n &= \textcolor{blue}{F_{n-1} }+ F_{n-2} = \textcolor{blue}{(F_{n-2} + F_{n-3} )} + (F_{n-3} + F_{n-4}) \\ &= \textcolor{blue}{(F_{n-3} + F_{n-4} + F_{n-3} )} + (F_{n-3} + F_{n-4}) \\ &= 3F_{n-3} + 2F_{n-4} \\ \therefore F_n &\cong 2 \cdot F_{n-4} \pmod 3
\end{align} \]
The first number is divisible by 3 at 4 t h position,
In { F 1 , F 2 , F 3 , F 4 } , only F 4 is divisible by 3. Therefore, only F 4 n is divisble by 3 for any positive integer n .
Within first 1 0 0 t h number, Alice starts at the 1 s t position and repeat at ( 1 + 5 m ) position where m = 0 , 1 , 2 . . . . , 1 9 .
Alice yells at ( 1 + 5 m ) position and she claps also when m ≅ 3 ( m o d 4 ) where m = 0 , 1 , 2 . . . . , 1 9 .
There are 5 such m = { 3 , 7 , 1 1 , 1 5 , 1 9 } corresponding to F 1 6 , F 3 6 , F 5 6 , F 7 6 , F 9 6 . So, she clapped 5 times.
The numbers yelled by the five girls are the Fibonacci numbers F n . Alice yells F 1 , Betty yells F 2 , Cathy yells F 3 and so on. We note hat F n is divisible by 3 , when n is divisible by 4 or in modular arithmetic , F n ≡ 0 (mod 3) when n ≡ 0 (mod 4) . Since Alice is the first to yell, her sequence of yelling is given by 5 k + 1 , where k = 0 , 1 , 2 , ⋯ . And she needs to clap when:
5 k + 1 k + 1 k ⟹ k ≡ 0 (mod 4) ≡ 0 (mod 4) ≡ − 1 ≡ 3 (mod 4) ≡ 4 m + 3 where m = 0 , 1 , 2 , ⋯
So Alice claps when n = 5 k + 1 = 5 ( 4 m + 3 ) + 1 = 2 0 m + 1 6 , where 2 0 m + 1 6 ≤ 1 0 0 , ⟹ m ≤ 4 . Therefore Alice claps 5 times, when m = 0 , 1 , 2 , 3 , 4 for F 1 6 , F 3 6 , F 5 6 , F 7 6 , F 9 6 .
Problem Loading...
Note Loading...
Set Loading...
The sequence the girls yell is called the Fibonacci sequence . Study the numbers divisible by three in the sequence. 1 , 1 , 2 , 3 , 5 , 8 , 1 3 , 2 1 , 3 4 , 5 5 , 8 9 , 1 4 4 . . . We see that there is a period of 4. Since LCM ( 4 , 5 ) = 2 0 and her first clap will be on the sixteenth number, Alice will clap at the 1 6 , 3 6 , 5 6 , 7 6 , 9 6 t h times. Hence the answer is 5 .