$10^n = 1 \bmod 13$, find $n$
4972
Mod of numbers with large exponents [modular order reduction]
147665
$a_1=3;\ a_{n+1}=3^{a_n}$; find $a_{2004}\bmod100$
90438
To prove that if $ab\equiv ac\bmod n$ and $(a,n)=1$ then $b\equiv c\bmod n$
67312
How to find the last digit of $3^{1000}$?
72406
Last two digits of $2^{1000}$ via Chinese Remainder Theorem?
13317
show that $a^{12} \equiv 1 \mod 32760$ for each $a \in \mathbb{Z}$ such that $\text{gcd}(a, 32760) = 1$
93820
Fermat's little theorem applied for $n$'th root existence $\!\bmod p$
124969
How do I calculate n modulo 3 in LaTeX?
149929
Calculating (a^b)%MOD
77351
How to use Fermat's little theorem to find $50^{50}\pmod{13}$?
123144
Formula : (Exact) Sum of $1^1+2^2+3^3+..+n^n$ (modulo $10^m$) with relatively small $m$
76495
How many points in RSA, such that $m^e = m \bmod n$
126689
Find the number of natural solutions of $5^x+7^x+11^x=6^x+8^x+9^x$
52461
Why does $(g^b \bmod m)^a \bmod m = (g^a \bmod m)^b \bmod m$?
360
Modular exponentiation by hand ($a^b\bmod c$)
36031
Finding modular of a fraction
15436
Find p and q s.t. $({p-1})^{q-1}+({q-1})^{p-1} \equiv 101 \pmod {pq}$