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.
As we know, 2019 is an ood, so we just need to look the ood pattern
we can use the pattern : to found last-2 digits use (mod 100)
2 0 1 9 1 ≡ 1 9 ( m o d 1 0 0 )
2 0 1 9 3 ≡ 5 9 ( m o d 1 0 0 )
2 0 1 9 5 ≡ 9 9 ( m o d 1 0 0 )
2 0 1 9 7 ≡ 3 9 ( m o d 1 0 0 )
2 0 1 9 9 ≡ 7 9 ( m o d 1 0 0 )
2 0 1 9 1 1 ≡ 1 9 ( m o d 1 0 0 )
...
So, the pattern repeat every 5 ood number
2019 is 1010th ood, and 1010 is divisible by 5
So, the last 2-digits of 2 0 1 9 2 0 1 9 same as 2 0 1 9 9 = 7 9
Problem Loading...
Note Loading...
Set Loading...
2 0 1 9 2 0 1 9 ≡ 1 9 2 0 1 9 m o d λ ( 1 0 0 ) (mod 100) ≡ 1 9 2 0 1 9 m o d 2 0 (mod 100) ≡ 1 9 1 9 (mod 100) ≡ ( 2 0 − 1 ) 1 9 (mod 100) ≡ 3 8 0 − 1 (mod 100) ≡ 7 9 (mod 100) Since g cd ( 1 9 , 1 0 0 ) = 1 , Euler’s theorem applies Carmichael’s lambda function λ ( 1 0 0 ) = 2 0
References: