Groups
Category
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)\).
Miller–Rabin is a fast primality test that uses modular exponentiation to detect compositeness with very high reliability.