Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Primeshard
0:00.0

The 'Heath-Brown's Theorem' (1984) on prime gaps states that there are infinitely many nnn such that pn+1−pn<ln⁡pnp_{n+1} - p_n < \ln p_npn+1​−pn​<lnpn​. What is the constant factor for the logarithmic gap in the best version of this theorem?