Concepts2
∑MathIntermediate
Modular Inverse
A modular inverse of a modulo m is a number a_inv such that a × a_inv ≡ 1 (mod m).
#modular inverse#extended euclidean algorithm#fermats little theorem+12
∑MathIntermediate
Fermat's Little Theorem
Fermat's Little Theorem says that for a prime p and integer a not divisible by p, a^{p-1} ≡ 1 (mod p).
#fermat's little theorem#modular inverse#binary exponentiation+11