Find the last two digits of 2 0 1 6 2 0 1 6 × 2 0 1 7 2 0 1 7 × 2 0 1 8 2 0 1 8 .
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.
Let the number given be N . We need to find N m o d 1 0 0 .
N ≡ 2 0 1 6 2 0 1 6 × 2 0 1 7 2 0 1 7 × 2 0 1 8 2 0 1 8 (mod 100) ≡ 1 6 2 0 1 6 × 1 7 2 0 1 7 × 1 8 2 0 1 8 (mod 100)
Since g cd ( 1 6 , 1 8 , 1 0 0 ) = 1 , we have to consider the factors 4 and 25 of 100 separately using Chinese remainder theorem.
For factor 4 : 1 6 2 0 1 6 ≡ 0 (mod 4) and 1 8 2 0 1 8 ≡ ( 1 6 + 2 ) 2 0 1 8 ≡ 0 (mod 4)
For factor 25 :
1 6 2 0 1 6 ≡ 1 6 2 0 1 6 m o d ϕ ( 2 5 ) (mod 25) ≡ 1 6 2 0 1 6 m o d 2 0 (mod 25) ≡ 1 6 1 6 (mod 25) ≡ 2 6 4 m o d 2 0 (mod 25) ≡ 2 4 ≡ 1 6 (mod 25) ≡ 1 6 (mod 100) Since g cd ( 1 6 , 2 5 ) = 1 , Euler theorem applies. Euler totient function ϕ ( 2 5 ) = 2 0 Apply Euler theorem again. Since 1 6 2 0 1 6 ≡ 0 (mod 4)
1 8 2 0 1 8 ≡ 1 8 2 0 1 8 m o d ϕ ( 2 5 ) (mod 25) ≡ 1 8 2 0 1 8 m o d 2 0 (mod 25) ≡ 1 8 1 8 (mod 25) ≡ 2 1 8 3 3 6 m o d 2 0 (mod 25) ≡ 2 1 0 2 8 3 1 6 (mod 25) ≡ 2 4 × 6 × 3 × ( 2 5 + 2 ) 5 (mod 25) ≡ ( − 1 ) × 6 × 3 × 7 (mod 25) ≡ − 1 ≡ 2 4 (mod 25) ≡ 2 4 (mod 100) Since g cd ( 1 8 , 2 5 ) = 1 , Euler theorem applies. Euler totient function ϕ ( 2 5 ) = 2 0 Apply Euler theorem again. Since 1 8 2 0 1 8 ≡ 0 (mod 4)
Now consider
1 7 2 0 1 7 ≡ 1 7 2 0 1 7 m o d ϕ ( 1 0 0 ) (mod 100) ≡ 1 7 2 0 1 7 m o d 4 0 (mod 100) ≡ 1 7 1 7 (mod 100) ≡ ( 2 0 − 3 ) 1 5 1 7 2 (mod 100) ≡ − 3 1 5 8 9 (mod 100) ≡ 3 ( 1 0 − 1 ) 7 1 1 (mod 100) ≡ 3 × 6 9 × 1 1 (mod 100) ≡ 7 7 (mod 100) Since g cd ( 1 7 , 1 0 0 ) = 1 , Euler theorem applies. Euler totient function ϕ ( 1 0 0 ) = 4 0
Therefore, N ≡ 1 6 × 7 7 × 2 4 ≡ 3 2 × 2 4 ≡ 6 8 (mod 100) .
Problem Loading...
Note Loading...
Set Loading...
We notice that the last two digits of 2 0 1 6 n , 2 0 1 7 n and 2 0 1 8 n each have their respective cycles:
Notice that the last two digits 2 0 1 6 n has a fixed five-number cycle 1 6 , 5 6 , 9 6 , 3 6 , 7 6 before repeating itself again. Therefore, we can deduce that the last two digits of 2 0 1 6 2 0 1 6 is 16, which is the first number in the cycle, because 2 0 1 6 ≡ 1 ( m o d 5 ) .
Similarly for 2 0 1 7 2 0 1 7 and 2 0 1 8 2 0 1 8 , we can use the same method we used in 2 0 1 6 2 0 1 6 .
Last two digits of 2 0 1 7 n : 1 7 , 8 9 , 1 3 , 2 1 , 5 7 , 6 9 , 7 3 , 4 1 , 9 7 , 4 9 , 3 3 , 6 1 , 3 7 , 2 9 , 9 3 , 8 1 , 7 7 , 0 9 , 5 3 , 0 1 , 1 7 , . . . . . . The last two digits of 2 0 1 7 n is has a fixed 20-number cycle 1 7 , 8 9 , 1 3 , 2 1 , 5 7 , 6 9 , 7 3 , 4 1 , 9 7 , 4 9 , 3 3 , 6 1 , 3 7 , 2 9 , 9 3 , 8 1 , 7 7 , 0 9 , 5 3 , 0 1 , so we know that the last two digits of 2 0 1 7 n is the 17th number in the cycle, which is 77 because 2 0 1 6 ≡ 1 7 ( m o d 2 0 ) .
Last two digits of 2 0 1 8 n : 1 8 , 2 4 , 3 2 , 7 6 , 6 8 , 2 4 , 3 2 , . . . . . . The last two digits of 2 0 1 8 n is has a fixed 4-number cycle 2 4 , 3 2 , 7 6 , 6 8 after the first term 18, so we know that the last two digits of 2 0 1 7 n is the 1st number in the cycle, which is 24 because ( 2 0 1 8 − 1 ) ≡ 1 ( m o d 4 ) .
Since we have the last two digits of 2 0 1 6 n , 2 0 1 7 n and 2 0 1 8 n which are 16,77 and 24 respectively, so we can find the last two digits of their product, which is the last two digits of 1 6 × 7 7 × 2 4 , which is 6 8 .