Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Primorial bound n#⋅25n<68nn\#\cdot25^n<68^nn#⋅25n<68n for 2.8⋅107<n≤3.2⋅1072.8\cdot10^7<n\le3.2\cdot10^72.8⋅107<n≤3.2⋅107

Proved
LL_Decomp551a.primorial_c5_upper_second

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

number-theory

For every natural number nnn with 28000000<n≤3200000028000000<n\le3200000028000000<n≤32000000, 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_upper_second (n : ℕ) (hn : 28000000 < n) (hn' : n ≤ 32000000) :
    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_upper_second

The Lean declaration is a theorem named primorial_c5_upper_second in the namespace LL_Decomp551a. It takes one natural number nnn and two hypotheses: hn : 28000000 < n and hn' : n ≤ 32000000. Together they say 28,000,000<n≤32,000,00028{,}000{,}000 < n \le 32{,}000{,}00028,000,000<n≤32,000,000, so nnn ranges over the integers from 28,000,00128{,}000{,}00128,000,001 to 32,000,00032{,}000{,}00032,000,000 inclusive. There are no other binders, typeclass assumptions, or local definitions. The only named object is Mathlib's primorial. The conclusion is a strict inequality in natural-number arithmetic (no division, no real numbers, no truncated subtraction):

n#⋅25 n  <  68 nn\# \cdot 25^{\,n} \;<\; 68^{\,n}n#⋅25n<68n

Here n#n\#n# denotes primorial n, the product of all primes p≤np \le np≤n. Dividing both sides by 25n25^n25n gives the equivalent form n#<(68/25)n=2.72nn\# < (68/25)^n = 2.72^nn#<(68/25)n=2.72n. The statement is strict, with no equality case, and it asserts this for every nnn in the range above.

Concerns. The proof is by sorry, so Lean accepts the file only with a sorry warning. The declaration is an unproved claim, and the file establishes nothing about its truth. The hypotheses are satisfiable (for example n=28,000,001n = 28{,}000{,}001n=28,000,001), so the statement is not vacuous. It is not trivially true either. By Chebyshev's function, log⁡n#=θ(n)∼n\log n\# = \theta(n) \sim nlogn#=θ(n)∼n, so n#n\#n# grows roughly like ene^nen, and 2.72/e≈1.000632.72 / e \approx 1.000632.72/e≈1.00063. The margin is therefore thin in logarithmic terms: about 0.00063 n0.00063\,n0.00063n nats, roughly 17,700 at n=28,000,000n = 28{,}000{,}000n=28,000,000 and 20,200 at n=32,000,000n = 32{,}000{,}000n=32,000,000. Explicit bounds of the form θ(x)<x\theta(x) < xθ(x)<x valid in this range would imply the inequality, but the file does not use them and I did not verify them here. The name contains "c5" and "upper_second", but nothing in the statement mentions 5 or a second bound, so those words are labels only. Nothing else looks non-standard: primorial is the ordinary Mathlib definition, all arithmetic is in ℕ, and no junk-value or coercion issues arise for nnn in this range.

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