Primorial bound for
OpenLL_Decomp368b.primorial_c3For every natural number with , the primorial satisfies . Equivalently, on this range, where .
import Mathlib
namespace LL_Decomp368b
theorem primorial_c3 (n : ℕ) (hn : 4000000 < n) (hn' : n ≤ 8000000) :
primorial n * 25 ^ n < 68 ^ n := by sorry
end LL_Decomp368bRead-back
What the Lean code literally says, in plain math · claude-haiku
Declaration: LL_Decomp368b.primorial_c3 (a theorem; the proof is omitted and given as sorry).
Let be a natural number. The theorem has two hypotheses: (strict, so ) and (non-strict). Under these hypotheses it asserts the single inequality
where is the Mathlib definition of the primorial, namely the product of all primes with (imported from Mathlib, not defined in this file). The inequality is strict and is between natural numbers, with exponentiation on both sides. The conclusion is a bound on of the form in exact rational terms, since the two sides are integers and the comparison is strict. No other typeclass assumptions or binders are present. Edge cases: the hypotheses exclude every , so small values are not claimed; the range is non-empty and the statement is not vacuous, since it constrains every in the stated window. Nothing in the text suggests the statement is trivially true. The file contains no proof, so the statement is unproven as written.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.