Three Modular Exponentiation Methods for Exponent Towers Explained

Modular exponentiation is a very common topic in public key cryptography and questions on remainders of extremely large numbers involving exponent towers (a^b^c etc) appear frequently on specialist maths papers dealing with this topic, as well as in Maths Olympiads. In this video we document three different methods to solve these types of questions, using a different example to clarify each method.

For those not familiar with Fermat's Little Theorem, we suggest watching our video 'Fermat's Little Theorem' at https://www.youtube.com/watch?v=VYhL2S_yWSM

It is probably useful to also watch our video 'Modular Exponentiation using the Repeated Squaring method' at https://www.youtube.com/watch?v=yCa9Fp_vLHw which documents another method to solve these types of questions.

For more videos on Remainders, see our playlist 'Remainders' at https://www.youtube.com/playlist?list=PLlX3COjsHPVCFmjYPwNMqAYRdsux0L7oZ

For more videos on Modular Maths see our playlist 'Modular Maths'
https://www.youtube.com/playlist?list=PLlX3COjsHPVC1fX-WCEmd7kuina2Hz6hS

For more JEE Aspirant videos see our playlist 'JEE Aspirants'
https://www.youtube.com/playlist?list=PLlX3COjsHPVAyTDuUPm9jQy6LtI4-KcHg

For more videos on Maths Olympiads, see our playlist 'Maths Olympiads'
https://www.youtube.com/playlist?list=PLlX3COjsHPVAxSyujoS5eDQNz3tj681y1

For more videos on College Entrance Exams see our playlist 'UPCAT and Other CETs''
https://www.youtube.com/playlist?list=PLlX3COjsHPVAfsDQxh84q-qOP2XK027Hv

For more videos on power rules, see our playlist 'Exponential Equations/Power Rules' at https://www.youtube.com/playlist?list=PLlX3COjsHPVDdo2BfBHewCdaXderrspc6