2 0 1 6 2 0 1 7 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ≡ ? ( m o d 1 0 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.
By Chinese remainder theorem ( m o d 1 0 0 ) is the same as ( m o d 2 5 ) and ( m o d 4 ) .
Since 2 0 1 6 = 4 ∗ 5 0 4 we know that the number is ≡ 0 ( m o d 4 )
( m o d 2 5 )
2 5 and 1 6 are coprime, so we can use Euler's totient function ϕ 2 5 = 2 0 .
2 0 and 1 7 are coprime, so, again, we can use Euler's totient function ϕ 2 0 = 2 3 .
2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ≡ 2 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ≡ 0 ( m o d 2 3 ) .
Now we have much simpler expression:
1 6 1 7 0 = 1 6 ( m o d 2 5 )
Since x ≡ 0 ( m o d 4 ) and x ≡ 1 6 ( m o d 2 5 ) we notice that 1 6 is the answer.
I used the fact that ( even no. ) 2 0 n ≡ 7 6 ( m o d 1 0 0 ) where n is any natural number and the number is not an even multiple of 5 .
So we need to find 2 0 1 7 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ( m o d 2 0 )
2 0 1 7 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ≡ 1 7 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ≡ ( − 3 ) 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ≡ 3 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ( m o d 2 0 )
Now, we know that 3 4 ≡ 1 ( m o d 2 0 ) and 2 0 1 8 a where a > 2 is divisible by 4 .
Therefore,
3 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ≡ 3 4 k ≡ ( 3 4 ) k ≡ 1 k ≡ 1 ( m o d 2 0 )
So, 2 0 1 7 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ≡ 1 ( m o d 2 0 ) .
Hence, 2 0 1 6 2 0 1 7 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ≡ 2 0 1 6 2 0 n + 1 ≡ ( 2 0 1 6 2 0 ) n × 2 0 1 6 ≡ 7 6 n × 2 0 1 6 ≡ 7 6 × 1 6 ≡ 1 6 ( m o d 1 0 0 ) ...because 7 6 raised to the power any natural number gives 7 6 as the last two digits.
So our answer becomes 1 6 .
N O T E :
By Euler's Theorem - n ϕ ( 2 5 ) ≡ 1 ( m o d 2 5 ) where n is co - prime to 2 5 .
So ( even no. ) 2 0 ≡ 1 ( m o d 2 5 ) . Hence possible last two digits are 0 1 , 2 6 , 5 1 , 7 6 .............. ϕ ( 2 5 ) = 2 0
But 0 1 and 5 1 are not possible since even number raised to the power anything is even.
2 6 is also not possible because even number raised to the power 2 0 is obviously divisible by 4 .
Hence possible last two digits is 7 6 only.
Good approach iteratively using Euler's Theorem.
Thanks you very much! Your solution shows your great knowledge.
Problem Loading...
Note Loading...
Set Loading...
⎩ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎧ 2 0 1 6 2 0 1 6 2 2 0 1 6 3 2 0 1 6 4 2 0 1 6 5 ≡ 1 6 (mod 100) ( 5 n + 1 ) ≡ 5 6 (mod 100) ( 5 n + 2 ) ≡ 9 6 (mod 100) ( 5 n + 3 ) ≡ 3 6 (mod 100) ( 5 n + 4 ) ≡ 7 6 (mod 100) ( 5 n )
⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ 2 5 2 6 2 7 2 8 ≡ 2 (mod 5) ( 4 n + 1 ) ≡ 4 (mod 5) ( 4 n + 2 ) ≡ 3 (mod 5) ( 4 n + 3 ) ≡ 1 (mod 5) ( 4 n )
{ 4 3 4 4 ≡ 4 (mod 5) ( 2 n + 1 ) ≡ 1 (mod 5) ( 2 n )
2 0 1 7 ≡ 2 (mod 5)
2 0 1 7 2 0 1 8 ≡ 2 2 0 1 8 (mod 5)
2 0 1 7 2 0 1 8 ≡ 4 (mod 5)
2 0 1 7 2 0 1 8 2 0 1 9 ≡ 4 2 0 1 9 (mod 5)
2 0 1 7 2 0 1 8 2 0 1 9 ≡ 4 (mod 5)
2 0 1 7 2 0 1 8 2 0 1 9 2 0 2 0 ≡ 4 2 0 2 0 (mod 5)
2 0 1 7 2 0 1 8 2 0 1 9 2 0 2 0 ≡ 1 (mod 5)
2 0 1 7 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ≡ 1 2 0 1 6 2 0 1 6 (mod 5)
2 0 1 7 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ≡ 1 (mod 5)
2 0 1 6 2 0 1 7 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 = 2 0 1 6 5 m + 1 ,where m is a positive integer.
⇒ 2 0 1 6 2 0 1 7 2 0 1 8 2 0 1 9 2 0 2 0 2 0 1 6 2 0 1 6 ≡ 1 6 (mod 100)