Concepts4
βMathIntermediate
Euler's Totient Function
Euler's Totient Function Ο(n) counts how many integers from 1 to n are coprime with n.
#euler totient#phi function#coprime count+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
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
βMathIntermediate
Sieve of Eratosthenes
The Sieve of Eratosthenes marks multiples of each prime to find all primes up to n in O(n log log n) time.
#sieve of eratosthenes#segmented sieve#linear sieve+11