A prime number is a natural number greater than $1$ which has no positive divisors other
than $1$ and itself.
This article covers different algorithms for checking if a number is prime or not, including
a naive test, the Eratosthenes Sieve, the Euler Primality Test, and the Miller-Rabin Primality Test.
Published on Thu, Jun 11, 2015 • 7 min read
#math
#number theory
#prime numbers
#erathostenes sieve
