Computing $a^b$ (mod c) where b is a very large number
360
Modular exponentiation by hand ($a^b\bmod c$)
13317
show that $a^{12} \equiv 1 \mod 32760$ for each $a \in \mathbb{Z}$ such that $\text{gcd}(a, 32760) = 1$
48949
Solving a Diophantine equation with a large solution
9118
Polynomial division: an obvious trick? [reducing mod $\textit{simpler}$ multiples]
89203
What is the fastest (known) algorithm to find the n-th Catalan number mod m?
113458
How to factor $a^n - b^n$?
1539
How do you calculate the modulo of a high-raised number?
157771
Nested exponent modulus, $2^{2^{517}} \pmod {23}$
105719
Complex numbers modulo integers
14783
A Number Theory problem (GCD)
108237
Show $a^p \equiv b^p \mod p^2$
39969
Algorithms for computing multiplicative order modulo $n$
314
Calculating RSA private exponent when given public exponent and the modulus factors using extended euclid
95890
GCD algorithms for a large integers
24924
Computing an infinite product
141010
Computing $n$-th external power of standard simplectic form
141704
Fractional exponentiation in modular arithmetic