For as defined above, find last four digits of .
This problem is original and belongs to the set Number theory best 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.
Since 2 0 1 5 ≡ − 1 ( m o d 1 6 ) and the tetration 4 2 0 1 5 = 2 0 1 5 2 0 1 5 2 0 1 5 2 0 1 5 is odd, we see that f ( 2 0 1 5 ) = 5 2 0 1 5 ≡ − 1 ( m o d 1 6 ) . On the other hand, 2 0 1 5 ≡ 0 ( m o d 5 ) , and hence f ( 2 0 1 5 ) ≡ 0 ( m o d 6 2 5 ) . Using the Chinese Remainder Theorem, we deduce that f ( 2 0 1 5 ) ≡ 9 3 7 5 ( m o d 1 0 0 0 0 ) .
Since 2 0 1 8 is even, it is clear that f ( 2 0 1 8 ) ≡ 0 ( m o d 1 6 ) . Note now that 2 0 1 8 4 ≡ 1 ( m o d 2 5 ) , so that 2 0 1 8 1 0 0 ≡ 1 ( m o d 6 2 5 ) . Since it is clear that 3 2 0 1 8 ≡ 0 ( m o d 4 ) , we deduce that 4 2 0 1 8 ≡ 1 ( m o d 2 5 ) . On the other hand it is clear that 4 2 0 1 8 ≡ 0 ( m o d 4 ) . Using the Chinese Remainder Theorem, we see that 4 2 0 1 8 ≡ 7 6 ( m o d 1 0 0 ) , and hence f ( 2 0 1 8 ) ≡ 2 0 1 8 7 6 ≡ 4 0 1 ( m o d 6 2 5 ) .Using the Chinese Remainder Theorem again, we have that f ( 2 0 1 8 ) ≡ 9 7 7 6 ( m o d 1 0 0 0 0 ) .
Note that 2 0 2 1 ≡ 1 ( m o d 4 ) and that 2 0 2 1 4 ≡ 1 ( m o d 1 6 ) . Thus it is clear that 4 2 0 2 1 ≡ 1 ( m o d 4 ) and hence that f ( 2 0 2 1 ) ≡ 2 0 2 1 ≡ 5 ( m o d 1 6 ) . Now note that 2 0 2 1 5 ≡ 1 ( m o d 2 5 ) , 2 0 2 1 2 5 ≡ 1 ( m o d 1 2 5 ) and 2 0 2 1 1 2 5 ≡ 1 ( m o d 6 2 5 ) . Since 2 0 2 1 2 0 2 1 ≡ 1 ( m o d 5 ) , we deduce that 3 2 0 2 1 ≡ 2 0 2 1 ≡ 2 1 ( m o d 2 5 ) , so that 4 2 0 2 1 ≡ 2 0 2 1 2 1 ≡ 4 6 ( m o d 1 2 5 ) , and thus f ( 2 0 2 1 ) ≡ 2 0 2 1 4 6 ≡ 4 6 ( m o d 6 2 5 ) . Using the Chinese Remainder Theorem one more time, f ( 2 0 2 1 ) ≡ 4 4 2 1 ( m o d 1 0 0 0 0 ) .
Thus f ( 2 0 1 5 ) + f ( 2 0 1 8 ) + f ( 2 0 2 1 ) ≡ 9 3 7 5 + 9 7 7 6 + 4 4 2 1 ≡ 3 5 7 2 ( m o d 1 0 0 0 0 )