Concepts3
∑MathAdvanced
Primitive Roots
A primitive root modulo n is a number g that cycles through all units modulo n when you repeatedly multiply by g, so its multiplicative order equals \(\varphi(n)\).
#primitive root#multiplicative order#euler totient+10
∑MathIntermediate
Miller-Rabin Primality Test
Miller–Rabin is a fast primality test that uses modular exponentiation to detect compositeness with very high reliability.
#miller-rabin#primality test#probable prime+11
∑MathIntermediate
Prime Factorization
Prime factorization expresses any integer greater than 1 as a product of primes raised to powers, uniquely up to ordering.
#prime factorization#trial division#spf sieve+12