Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Primorial bound n#⋅25n<68nn\#\cdot25^n<68^nn#⋅25n<68n for 2.0⋅107<n≤2.4⋅1072.0\cdot10^7<n\le2.4\cdot10^72.0⋅107<n≤2.4⋅107

Proved
LL_Decomp551a.primorial_c5_lower_second

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

number-theory

For every natural number nnn with 20000000<n≤2400000020000000<n\le2400000020000000<n≤24000000, 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_second (n : ℕ) (hn : 20000000 < n) (hn' : n ≤ 24000000) :
    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_second

The file opens with import Mathlib and places the declaration in the namespace LL_Decomp551a. The declaration is a theorem named primorial_c5_lower_second. It takes one natural-number variable nnn (Lean type ℕ, so n≥0n \ge 0n≥0 and all values are non-negative integers) and two hypotheses. The first, hn, says 20000000<n20000000 < n20000000<n, a strict inequality, so n≥20000001n \ge 20000001n≥20000001. The second, hn', says n≤24000000n \le 24000000n≤24000000. Together the hypotheses restrict nnn to the integer interval 20000001≤n≤2400000020000001 \le n \le 2400000020000001≤n≤24000000. Both hypotheses are satisfiable, so the statement is not vacuous. The conclusion is primorial n * 25 ^ n < 68 ^ n. Here primorial n is Mathlib's primorial function, the product of all prime numbers ppp with p≤np \le np≤n, written n#n\#n# in standard notation. The claim is therefore

n#⋅25 n  <  68 nfor every integer n with 20000001≤n≤24000000,n\# \cdot 25^{\,n} \;<\; 68^{\,n} \qquad \text{for every integer } n \text{ with } 20000001 \le n \le 24000000,n#⋅25n<68nfor every integer n with 20000001≤n≤24000000,

which is equivalent, after dividing by 25n>025^n > 025n>0, to n#<(68/25)nn\# < (68/25)^nn#<(68/25)n, where 68/25=2.7268/25 = 2.7268/25=2.72. Every quantity is a natural number, so there is no truncated subtraction or division-by-zero junk value to worry about. The strict inequality is <, not ≤. The statement is a bounded-range claim, covering only the 4,000,000 values of nnn in that interval, not all natural numbers. Note that the proof body is by sorry. Lean accepts the declaration but the proof is missing, so the file asserts the statement without establishing it. Nothing in the text shows the purpose of the constants 25 and 68, so their role is not stated in the Lean text itself.

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