Generating Prime Numbers -- A Fast New Method

V. Vilfred Kamalappan

Bertrand's Postulate ensures existence of prime $p$ between $n$ and $2n$, $n$ an integer $\ge 2$ and the sieve of Eratosthenes, a very simple ancient algorithm, generates all prim…