In a recent forum discussion on number theory, it was mentioned that A. E. Ingham had proven that there is always a prime between $n^3$ and $(n+1)^3$.
Does anyone know if there is a link available on the web or knows a rough sketch of the proof. Does it use sieve theory?
I am very interested in checking out the proof.
I'd venture the discussion in the fora was mistaken.
As late as 2014, it appears the best is a bound on where this is true, from
An Explicit Result for Primes Between Cubes - A. Dudek