Deterministic Methods to Find Primes
By David Lowry
November 16, 2011
Although it is known how to find a prime with high probability very quickly, current deterministic algorithms to find primes are very slow. We will explore recent developments in deterministic methods to find primes and see many open problems related (though often not obviously so) to finding primes quickly, culminating with the results of the recent paper Deterministic Methods to Find Primes by the DHJ Polymath4 group (Croot, Helfgott, Tao, Lowry, Hollis, and others).