Modular Arithmetic ( using Euler's Totient Theorem )
360
Modular exponentiation by hand ($a^b\bmod c$)
9039
What is the best way to solve modular arithmetic equations such as $9x \equiv 33 \pmod{43}$?
16700
Modular reduction of fractions
152299
Proving $a^{n-1} \equiv 1 \mod n $ when n is not prime.
5486
RSA: How Euler's Theorem is used?
135302
Proof on Euler totient function
17690
Ways to prove Euler's formula for $\zeta(2n)$
119048
What is the Euler Totient of Zero?
146053
Proving identities (mod $pq$) using Fermat's little theorem?
157771
Nested exponent modulus, $2^{2^{517}} \pmod {23}$
34192
Solve $x^{5} \equiv 2$ mod $221\ $ [Taking modular $k$'th roots if unique]
142788
Can't use Euler's Theorem?
31184
Sums of powers below a prime
99037
Prove the sum of all numbers that do not have a multiplicative inverse mod $n$
141704
Fractional exponentiation in modular arithmetic
9787
Primitive roots modulo primes congruent to n!
1970
Inverse Euler totient function