Large gaps between primes — mentioned by euid

Mon, 22 Dec 2014 16:00:48 GMT

For those who don't wish to read all the news fluff to hear about a mathematical discovery:[1] Abstract. We show that there exists pairs of consecutive primes less than x whose difference is larger than t(1+o(1))(log x)(log log x)(log log log log x)(log log log x)⁻² for any fixed t. This answers a well-known question of Erdős. Their "key proposition", as stated, is:[2] Proposition 5. Fix δ > 0. Let m < Uz⁻¹(log₂ x)⁻² be even and let Iₘ ⊆ [x/2, x] be an interval of at least δ|ℝₘ| log x. Then for x > x₀ (δ, C_U) there exists a choice of residue classes aₙ (mod n) for each prime n ∈ Iₘ such that…

Paper and discussion history. A mention is not an endorsement.

Large gaps between primes · HackerPapers discussions

Large gaps between primes — mentioned by euid