Number Theory Formulas
Number theory formulas for prime factorization, divisibility rules, modular arithmetic, Fibonacci sequence, and integer properties.
Euclidean Algorithm (GCD)
Reference for the Euclidean Algorithm: find the GCD of two integers via gcd(a, b) = gcd(b, a mod b). Includes worked examples and extended GCD.
Fermat's Little Theorem
Reference for Fermat's Little Theorem: a^(p-1) ≡ 1 (mod p) when p is prime and gcd(a, p) = 1. Foundation of RSA and modular exponentiation.
Prime Counting Function
Estimate how many primes exist below any value using the prime counting function π(x) and prime number theorem approximation π(x) ≈ x/ln(x).