Thread: Modular Exponentiation?

Hi, I'm having trouble understanding how to evaluate the last digits of a given extremely large number. I know it has something to do with modular math, but I'm struggling with that still. If anyone could explain how to :

Find the last let's say 2 digits of 1402^1402. It would be very appreciated, because I'm really interested in modular methods, I just keep struggling on them.

If you have any other helpful tips, I'll gladly listen, thanks

There really aren't any firm recipes for solving congruence problems, just as there aren't any general math recipes. Here's a solution to the one problem you posed.