Bertrand’s postulate states that for every integer , there is a prime satisfying The statement is elementary, but it is remarkably strong: no matter how far one goes along the number line, one never encounters a multiplicative gap as large as a factor of containing no primes. Erdős’s proof (1932) of this fact is centered […]