If a 0 = sin 2 ( 4 5 π ) and a n + 1 = 4 a n ( 1 − a n ) for n ≥ 0 , find the smallest positive integer n such that a n = a 0 .
If you come to the conclusion that no such n exists, enter 666.
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.
Smart, but again s a m e solution!!
Try @https://brilliant.org/problems/tedious-i/
Yes, exactly, Comrade! Wonderfully explained, as usual. (+1)
I know I'm weak in number theory. Still, how did you approach the last step?
Log in to reply
I tried to show a simple approach but I could not. I used an Excel spreadsheet to calculate the modulo (remainders). Actually, not that tough. For n = 1 to 5 , 2 n ≡ 2 n ( m o d 4 5 ) = ± 1 , 2 6 ≡ 6 4 ≡ 1 9 ( m o d 4 5 ) , 2 7 ≡ 1 2 8 ≡ − 7 ( m o d 4 5 ) , 2 8 ≡ 2 5 6 ≡ 3 1 ( m o d 4 5 ) ...
Same solution!
Problem Loading...
Note Loading...
Set Loading...
We can claim that a n = sin 2 ( 4 5 2 n π ) and prove it by induction.
a n + 1 = 4 a n ( 1 − a n ) = 4 sin 2 ( 4 5 2 n π ) ( 1 − sin 2 ( 4 5 2 n π ) ) = 4 sin 2 ( 4 5 2 n π ) cos 2 ( 4 5 2 n π ) = sin 2 ( 4 5 2 n + 1 π )
The claim is also true for n + 1 . Therefore, the claim is true for all n .
For a n = a 0 ,
⇒ sin 2 ( 4 5 2 n π ) ⇒ 2 n ⇒ 2 n = sin 2 ( 4 5 π ) = sin 2 ( k π ± 4 5 π ) where k is a positive integer. ≡ 4 5 k ± 1 = ± 1 ( m o d 4 5 )
The smallest n is found to be 1 2 , as 2 1 2 ≡ 1 ( m o d 4 5 ) .