Last 2 digits using Euler's Totient Function

Nice video ❤

Thank you, sir. You are an incredible teacher, and I am currently preparing for my GRE. Your teaching style is truly exceptional.

This man just saved my life ❤

Thank you. this will help me in my yearly. Earned a sub

I like my version better. since it works in more cases. This only works when the number and the base are relatively prime. For instance 4 and 27. Mine works for situations like 20 and 8 as well as all cases where Euler's Totient Function works. I actually figured out mine from scratch before I even heard of Euler's Totient function or Euler's theorem. I actually started with trying to find a method for making code using numbers to different powers, but I ended up with a pattern instead.

Thank you for this video. Very informative. I struggled at the step of 3^31. Is there a way to quickly calculate that 3^15 is equivalent to 7 mod 100? I began making a table of powers of 3 mod 100, but realized I was using quite a bit of time. I didn't see a pattern. Once again, GREAT video!

Enjoy well