Erathostenes Sieve
There's a total of 2 articles.
Primality Test
math
number theory
prime numbers
erathostenes sieve
fermat primality test
euler primality test
miller-rabin primality test
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 erathostenes sieve, the euler primality test and the miller-rabin primality test.
Erathostenes Sieve
The erathostenes sieve is an algorithm to find prime numbers up to a positive number $n$
using $O(n)$ space.