Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Find the last two digits of , that is, its remainder on division by . First find and use Euler's theorem to cut the exponent down. Then finish with repeated squaring, keeping only two digits at each step. Give , the reduced exponent and the remainder on division by .
counts with . If , Euler's theorem gives
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Given. modulo , with .
Step 1. Euler. , so .
Step 2. Cut. , so .
Step 3. Square. , and . Then , and .
Step 4. Finish. .
Check. Since already, . The same answer, with less work.
Answer: , the exponent reduces to , and the last two digits are , a remainder of .
Watch out. A last-two-digits answer below has a leading zero: the number ends in , not in alone.
Log in to join the discussion.
Loading…