This is a continuation of Research Thread II of the “Finding primes” polymath project, which is now full.  It seems that we are facing particular difficulty breaching the square root barrier, in particular the following problems remain open: Can we deterministically find a prime of size at least n in time (assuming hypotheses such as … Continue reading (Research Thread III) Deterministic way to find primes