Last two digits of this big number

2 7 41 \large 27^{41}

What are the last two digits of the number above?


The answer is 27.

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.

1 solution

Chew-Seong Cheong
Aug 10, 2020

2 7 41 2 7 41 m o d ϕ ( 100 ) (mod 100) Since gcd ( 27 , 100 ) = 1 , Euler’s theorem applies. 2 7 41 m o d 40 (mod 100) Euler’s totient function ϕ ( 100 ) = 40 2 7 1 (mod 100) 27 (mod 100) \begin{aligned} 27^{41} & \equiv 27^{41 \bmod \blue{\phi(100)}} \text{ (mod 100)} & \small \blue{\text{Since }\gcd(27,100) = 1 \text{, Euler's theorem applies.}} \\ & \equiv 27^{41 \bmod \blue{40}} \text{ (mod 100)} & \small \blue{\text{Euler's totient function }\phi(100) = 40} \\ & \equiv 27^1 \text{ (mod 100)} \\ & \equiv \boxed{27} \text{ (mod 100)} \end{aligned}


References:

I was doing the course and I actually don't quite get why we can just put (mod 40) next to the exponent. Can you help explain? Thank you.

Barry Leung - 10 months ago

Log in to reply

Barry, please read up references I have provided.

Chew-Seong Cheong - 10 months ago

Log in to reply

The way I solved it is to rewrite 2 7 41 27^{41} as 2 7 40 × 2 7 1 27^{40} \times 27^{1} . Since 2 7 40 1 27^{40} ≡ 1 (mod 100). So 27 is the last two digits.

Barry Leung - 10 months ago

Log in to reply

@Barry Leung It is the same thing I do.

Chew-Seong Cheong - 10 months ago

@Barry Leung Because 2 7 40 n 2 7 0 1 (mod 100) 27^{40n} \equiv 27^0 \equiv 1 \text{ (mod 100)} only the remainder 41 m o d 40 = 1 41 \bmod 40 =1 counts.

Chew-Seong Cheong - 10 months ago

a mod b= a^(mod phi(b)) mod b

assume gcd(a,b) = 1

In this case, a = 27^41

Pi Han Goh - 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...