Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A prime strictly between consecutive large cubes: N3<p<(N+1)3−1N^3 < p < (N+1)^3 - 1N3<p<(N+1)3−1

Open
FCP.Mills.prime_between_consecutive_cubes

by Himan · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

Let pnp_npn​ denote the nnn-th prime. Ingham (1937) proved that there is a constant KKK with pn+1−pn<K pn5/8p_{n+1} - p_n < K\,p_n^{5/8}pn+1​−pn​<Kpn5/8​ for all nnn. Mills (1947) drew from this the following lemma, which is the only arithmetic input of his prime-representing function: there is a threshold N0N_0N0​ such that for every integer N≥N0N \ge N_0N≥N0​ some prime ppp satisfies

N3<p<(N+1)3−1.N^3 < p < (N+1)^3 - 1.N3<p<(N+1)3−1.

Indeed, if pnp_npn​ is the largest prime not exceeding N3N^3N3, then N3<pn+1<N3+KN15/8N^3 < p_{n+1} < N^3 + K N^{15/8}N3<pn+1​<N3+KN15/8, and KN15/8<3N2+3NK N^{15/8} < 3N^2 + 3NKN15/8<3N2+3N once N>K8N > K^8N>K8.

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 Pk+1∈(Pk3,(Pk+1)3−1)P_{k+1} \in (P_k^3, (P_k+1)^3 - 1)Pk+1​∈(Pk3​,(Pk​+1)3−1) of Mills' sequence of primes.

Formalization Note The upper bound p<(N+1)3−1p < (N+1)^3 - 1p<(N+1)3−1 is written as p+1<(N+1)3p + 1 < (N+1)^3p+1<(N+1)3 so that no truncated subtraction of natural numbers appears. All quantities are natural numbers.

Preamble
import Mathlib
import Definitions.Def_FCP_Mills
Formal statement
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
Source
W. H. Mills, A prime-representing function, Bull. Amer. Math. Soc. 53 (1947), 604, the Lemma; it rests on A. E. Ingham, On the difference between consecutive primes, Quart. J. Math. Oxford Ser. 8 (1937), 255-266.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me