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 2 and 100 are not coprime integers, we cannot apply Euler's theorem straightaway. Let us consider 2 1 0 0 mod 4 and 2 1 0 0 mod 2 5 separately, as 1 0 0 = 4 × 2 5 .
2 1 0 0 2 1 0 0 2 1 0 0 2 1 0 0 ⟹ 2 5 n + 1 n + 1 n n ⟹ 2 1 0 0 ≡ 0 (mod 4) ≡ 2 1 0 0 mod ϕ ( 2 5 ) (mod 25) ≡ 2 1 0 0 mod 2 0 (mod 25) ≡ 2 0 ≡ 1 (mod 25) ≡ 0 (mod 4) ≡ 0 (mod 4) ≡ − 1 (mod 4) ≡ 3 (mod 4) ≡ 2 5 n + 1 (mod 100) ≡ 7 6 (mod 100) Since g cd ( 2 , 2 5 ) = 1 , Euler’s theorem applies. Euler totient function ϕ ( 2 5 ) = 2 0
2 1 0 0 = 1 2 6 7 6 5 0 6 0 0 2 2 8 2 2 9 4 0 1 4 9 6 7 0 3 2 0 5 3 7 6
how did u get that !!??
Problem Loading...
Note Loading...
Set Loading...
Note that 2^12 ≡ 96 (mod 100) ≡ −4 (mod 100). Thus, 2^100 ≡ (2^12)^8(2^4) (mod 100) ≡ (−4)^8 2^4 (mod 100) ≡ 2^20 (mod 100) ≡ (−4)2^8 (mod 100) ≡ 76 (mod 100)