"how numbers are stored and used in computers"
The Sieve of Eratosthenes is an efficient algorithm for finding all prime numbers up to a given limit.
Trial division is a simple prime testing algorithm that checks if a number is prime by dividing it by all smaller numbers.
The Fermat test is a probabilistic method that determines if a number is likely prime by checking congruence properties.
The Miller-Rabin test is a probabilistic algorithm that assesses primality through repeated congruence checks.
The AKS test is a deterministic algorithm that verifies primality using polynomial congruences.
The Lucas-Lehmer test is a deterministic algorithm that checks if a number is prime by using properties of the Mersenne numbers.
The Baillie-PSW test is a probabilistic algorithm that determines if a number is prime by checking properties of the Jacobi symbol.
The Pocklington-Lehmer test is a deterministic algorithm that checks if a number is prime by using properties of the Jacobi symbol.
The BLS7-5 test is a deterministic algorithm that checks if a number is prime by using properties of the Jacobi symbol.