If Euler Totient function fails other methods to find the remainder for the modular exponentiation
360
Modular exponentiation by hand ($a^b\bmod c$)
109490
Modular arithmetic problem (mod $13$)
155012
Solving quadratic equations in modular arithmetic
19459
Find remainder of $F_n$ when divided by $5$
118955
Specific steps in applying the Chinese Remainder Theorem to solve modular problem splitting modulus
106120
Mathematica Improved Euler's Method
128749
Taylor's Remainder $x-\frac{x^2}{2}+\frac{x^3}{3(1+x)}<\log(1+x) <x-\frac{x^2}{2}+\frac{x^3}{3}$
22029
Solving modular arithmetic questions
140458
Infinite summation involving exponents
22053
Modular Arithmetic - Pirate Problem
5486
RSA: How Euler's Theorem is used?
55095
Why can't we separate fraction powers in euler's formula?
49938
Proof of $a^{\phi (n) +1} \equiv a \pmod{\! n} $ Carmichael generalization of Fermat-Euler's theorem.
66061
Why is the formula for calculating euler totient true?
36713
Solving multiple congruences by CRT = Chinese Remainder Theorem
124220
Using Euler's Totient Function, how do I find all values n such that $\phi(n)=12$?
9414
Is There a Natural Way to Extend Repeated Exponentiation Beyond Integers?