Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Primorial bound n#⋅25n<68nn\#\cdot25^n<68^nn#⋅25n<68n for 1.6⋅107<n≤2.0⋅1071.6\cdot10^7<n\le2.0\cdot10^71.6⋅107<n≤2.0⋅107

Proved
LL_Decomp551a.primorial_c5_lower_first

by sthubbar · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

For every natural number nnn with 16000000<n≤2000000016000000<n\le2000000016000000<n≤20000000, the primorial n#=∏p≤n, p primepn\#=\prod_{p\le n,\ p\text{ prime}}pn#=∏p≤n, p prime​p satisfies n#⋅25n<68nn\#\cdot25^n<68^nn#⋅25n<68n. Equivalently, θ(n)<nlog⁡(68/25)\theta(n)<n\log(68/25)θ(n)<nlog(68/25) on this range, where θ(n)=∑p≤nlog⁡p\theta(n)=\sum_{p\le n}\log pθ(n)=∑p≤n​logp.

Preamble
import Mathlib
Formal statement
namespace LL_Decomp551a
theorem primorial_c5_lower_first (n : ℕ) (hn : 16000000 < n) (hn' : n ≤ 20000000) :
    primorial n * 25 ^ n < 68 ^ n := by sorry
end LL_Decomp551a
Source
Derived from Schoenfeld, Math. Comp. 30, 1976, 337-360, p. 356, display 5.1*; used in Liu and Wang, Acta Arith. 105, 2002, 133-175.
Read-back

What the Lean code literally says, in plain math · claude-haiku

Read-back: LL_Decomp551a.primorial_c5_lower_first

Source. The file imports Mathlib and declares the theorem primorial_c5_lower_first inside the namespace LL_Decomp551a. There are no other definitions, hypotheses, or typeclass assumptions in the file.

Binders. The theorem takes one binder and two hypotheses:

  • n:Nn : \mathbb{N}n:N, a natural number.
  • hn : 16000000 < n, that is 16000000<n16000000 < n16000000<n, a strict lower bound.
  • hn' : n ≤ 20000000, that is n≤20000000n \le 20000000n≤20000000, an upper bound.

Together the hypotheses say nnn is an integer with 16 000 000<n≤20 000 00016\,000\,000 < n \le 20\,000\,00016000000<n≤20000000. Both bounds are inclusive or exclusive exactly as written. The lower bound excludes n=16 000 000n = 16\,000\,000n=16000000 itself.

Conclusion. For every such nnn:

primorial⁡(n)⋅25 n  <  68 n.\operatorname{primorial}(n) \cdot 25^{\,n} \;<\; 68^{\,n}.primorial(n)⋅25n<68n.

Here primorial⁡(n)\operatorname{primorial}(n)primorial(n) is Mathlib's Nat.primorial, defined as the product of all primes ppp with p≤np \le np≤n. In standard notation it is written n#n\#n#, so the claim reads n#⋅25n<68nn\# \cdot 25^n < 68^nn#⋅25n<68n. The statement is over the natural numbers, with no division and no real-number approximation, so the inequality is exact.

Equivalently, since 25n>025^n > 025n>0, the claim is n#<(68/25)n=(2.72)nn\# < (68/25)^n = (2.72)^nn#<(68/25)n=(2.72)n for each nnn in the range.

Proof status. The body is by sorry. The statement is unproved in this file. Nothing in the file establishes it.

Concerns for the human auditor.

  • Not vacuous. The hypotheses are satisfiable (for example n=16 000 001n = 16\,000\,001n=16000001), so the statement is not true merely because its premises are impossible.
  • Not trivially true. Primorials grow roughly like ene^nen (by the prime number theorem, ln⁡n#=θ(n)∼n\ln n\# = \theta(n) \sim nlnn#=θ(n)∼n), and e≈2.71828e \approx 2.71828e≈2.71828 is just below 2.722.722.72. The margin per unit of nnn is only about ln⁡(2.72)−1≈0.0006\ln(2.72) - 1 \approx 0.0006ln(2.72)−1≈0.0006, so the inequality is a tight, quantitative bound near the edge of what is true. It is not a crude estimate.
  • Only a finite window. The claim covers nnn in (16 000 000, 20 000 000](16\,000\,000,\ 20\,000\,000](16000000, 20000000] and says nothing for other nnn. A reader who expects a bound "for all large nnn" should note that this is a bounded-range statement.
  • Edge values. Because the range excludes small nnn, the usual edge cases (n=0n = 0n=0, n=1n = 1n=1, and the total-function behaviour of primorial) do not arise.
  • Naming. The name primorial_c5_lower_first suggests a "lower first" step of a larger decomposition. The file gives no information about how this lemma is used, and this read-back does not rely on any such intent.
Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Nov 17, 2026

    Confirmed by the mission captain (proposal self-audit).

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