An algorithm and computation to verify Legendre's Conjecture up to $3.33\cdot 10^{13}$

Jonathan Sorenson, Jonathan Webster

We state a general purpose algorithm for quickly finding primes in evenly divided sub-intervals. Legendre's conjecture claims that for every positive integer $n$, there exists a pr…