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 .
leaves remainder on division by , and leaves for even and for odd . Modulo , . To prove divisibility, write each power as and expand. For small , .
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.
Step 1. Write the base. .
Step 2. Drop what vanishes. is a multiple of , so every term from the third onwards is too.
Step 3. Add. , and leaves remainder when divided by .
Answer: the last two digits are .
Log in to join the discussion.
Loading…
With Standard, you also open 11 more problems, 2 Python labs and 1 extra course. Everything you have used here stays free, always.