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 • Fermat's Little Theorem
It is probably useful to also watch our video 'Modular Exponentiation using the Repeated Squaring method' at • Modular Exponentiation... which documents another method to solve these types of questions.
For more videos on Remainders, see our playlist 'Remainders' at • Remainders
For more videos on Modular Maths see our playlist 'Modular Maths'
• Modular Maths
For more JEE Aspirant videos see our playlist 'JEE Aspirants'
• JEE Aspirant
For more videos on Maths Olympiads, see our playlist 'Maths Olympiads'
• Maths Olympiads
For more videos on College Entrance Exams see our playlist 'UPCAT and Other CETs''
• UPCAT and other CETs
For more videos on power rules, see our playlist 'Exponential Equations/Power Rules' at • Exponential Equations/...

[@grestyacademy]

For more videos on Modular Maths see our playlist 'Modular Maths' at th-cam.com/play/PLlX3COjsHPVC1fX-WCEmd7kuina2Hz6hS.html

[@raintv5054]

good video presentation

[@grestyacademy]

Thanks for the support!