Let f ( x ) = x x x x . Find the last two digits of f ( 1 7 ) + f ( 1 8 ) + f ( 1 9 ) + f ( 2 0 ) .
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.
Sir can you explain it in brief
Log in to reply
This is a rather brief solution. The first two lines describe my method. Study Fermat's Little Theorem and the Euler totient function ϕ for more details.
In the details, I use A = x x x x , B = x x x , C = x x .
Great use of Euler's theorem..........
Problem Loading...
Note Loading...
Set Loading...
Strategy: to determine x n mod a , we split a into (powers) of distinct primes and determine the value of x n mod each of these factors. For a = 1 0 0 , these factors are 4 and 25.
Moreover, for the value of x n mod a we only need to know n mod ϕ ( a ) , where ϕ is the totient function. For instance, for x n mod 25 we only need to know n mod 20.
x = 17:
A = 1 7 B ≡ 1 mod 4. We wish to determine the remainder of A = 1 7 B ≡ ( − 8 ) B mod 25. Since ϕ ( 2 5 ) = 2 0 , we know that we only need to know B modulo 20.
Split 20 as 4 × 5 . The exponent B = 1 7 C ≡ 1 mod 4. We need to find B = 1 7 C ≡ 2 C mod 5. Since ϕ ( 5 ) = 4 , we only need to know C modulo 4. This is easy: C = 1 7 D ≡ 1 mod 4, so that B ≡ 2 1 ≡ 2 mod 5.
Now, since B ≡ 2 mod 5 and B ≡ 1 mod 4, we have B ≡ 1 7 ≡ − 3 mod 20. This means that A ≡ ( − 8 ) − 3 = − ( 2 − 1 ) 9 mod 25. Using − 1 2 ⋅ 2 = − 2 4 ≡ 1 mod 25, we have 2 − 1 = − 1 2 and A ≡ 1 2 9 ≡ 3 3 ≡ 2 mod 25.
Finally, from A ≡ 1 mod 4 and A ≡ 2 mod 25 it follows that A ≡ 7 7 mod 100.
x = 18:
A = 1 8 B ≡ 0 mod 4, since certainly B ≥ 2 . To determine A = 1 8 B ≡ ( − 7 ) B mod 25, we could again determine B to modulo 20. However, since 7 2 = 4 9 ≡ − 1 mod 25, we only need to know B to modulo 4. This is easy because 18 is even: B = 1 8 C ≡ 0 mod 4, and A ≡ ( − 7 ) 0 = ≡ 1 mod 25.
Since A ≡ 0 mod 4 and A ≡ 1 mod 25, we have A ≡ 7 6 mod 100.
x = 19:
A = 1 9 B ≡ ( − 1 ) B ≡ − 1 mod 4; we use the fact that B = 1 9 C is odd. Also, A = 1 9 B ≡ ( − 6 ) B mod 25. We will once again determine B modulo 20. (Calculation of 1 9 n mod 25 shows that we really only need B mod 10.)
Now B = 1 9 C ≡ ( − 1 ) C ≡ − 1 mod 4; likewise, B = 1 9 C ≡ ( − 1 ) C mod 5. It follows that B ≡ − 1 mod 20. Therefore A ≡ ( − 6 ) − 1 ≡ 4 mod 25. (We use ( − 6 ) ⋅ 4 = − 2 4 ≡ 1 mod 25.)
Combining A ≡ − 1 mod 4 and A ≡ 4 mod 25, we easily find A ≡ 7 9 mod 100.
x = 20: This is easy since 2 0 B ≡ 0 mod 100 for B ≥ 2 .
Finally, Adding, we get 7 9 + 7 6 + 7 7 + 0 ≡ 3 2 mod 100.