A prime strictly between consecutive large cubes:
OpenFCP.Mills.prime_between_consecutive_cubesLet denote the -th prime. Ingham (1937) proved that there is a constant with for all . Mills (1947) drew from this the following lemma, which is the only arithmetic input of his prime-representing function: there is a threshold such that for every integer some prime satisfies
Indeed, if is the largest prime not exceeding , then , and once .
The statement is a theorem, and the threshold is what makes it one: whether a prime lies between every pair of consecutive cubes is not known unconditionally. It is the single open child of the reduction of Mills' theorem, where it supplies each step of Mills' sequence of primes.
Formalization Note The upper bound is written as so that no truncated subtraction of natural numbers appears. All quantities are natural numbers.
import Mathlib import Definitions.Def_FCP_Mills
namespace FCP.Mills
theorem prime_between_consecutive_cubes :
∃ N₀ : ℕ, ∀ N : ℕ, N₀ ≤ N → ∃ p : ℕ, p.Prime ∧ N ^ 3 < p ∧ p + 1 < (N + 1) ^ 3 := by sorry
end FCP.Mills