Concepts5
βMathIntermediate
Modular Arithmetic Basics
Modular arithmetic is arithmetic with wrap-around at a fixed modulus m, like numbers on a clock.
#modular arithmetic#mod#modulo c+++12
β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
Euler's Theorem
Eulerβs Theorem says that if a and n are coprime, then a raised to the power Ο(n) is congruent to 1 modulo n.
#euler totient#euler theorem#modular exponentiation+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
βMathIntermediate
Fast Exponentiation
Fast exponentiation (binary exponentiation) computes a^n using repeated squaring in O(log n) multiplications.
#binary exponentiation#fast power#modular exponentiation+11