Trollathon #3.3 : The Mysterious Function

Number Theory Level pending

f ( 1 ) = 2 , f ( 2 ) = 4 , f ( 3 ) = 12 , f ( 4 ) = 262148 f(1) = 2, f(2) = 4, f(3) = 12, f(4) = 262148

Determine f ( 12001 ) f(12001) mod 2014 2014


The answer is 1932.

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.

1 solution

Zi Song Yeoh
Apr 4, 2014

Just note that f ( n ) = n f ( n 1 ) ( n 1 ) + n f(n) = n^{f(n - 1) - (n - 1)} + n and f ( 1 ) = 2 f(1) = 2 . and so by Euler's Theorem, we have 1200 1 1200 0 . . . 2 1 + 12001 12002 1932 ( m o d 2014 ) 12001^{12000^{...^{2^{1}}}} + 12001 \equiv 12002 \equiv 1932 \pmod{2014} .

This is not necessarily correct. Consider f ( x ) = 43687 x 3 262119 x 2 + 480550 x 262116 f(x) = 43687x^3-262119x^2+480550x-262116 . Then, f ( 1 ) = 2 f(1) = 2 , f ( 2 ) = 4 f(2) = 4 , f ( 3 ) = 12 f(3) = 12 , f ( 4 ) = 262148 f(4) = 262148 , and f ( 12001 ) = 75472264696476002 f(12001) = 75472264696476002 , which is congruent to 1278 ( m o d 2014 ) 1278 \pmod{2014} .

Michael Lee - 7 years ago

Log in to reply

I know by lagrange any number is possible :P

Zi Song Yeoh - 6 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...