Primorial bound for
OpenLL_Decomp368b.primorial_c4For every natural number with , the primorial satisfies . Equivalently, on this range, where .
import Mathlib
namespace LL_Decomp368b
theorem primorial_c4 (n : ℕ) (hn : 8000000 < n) (hn' : n ≤ 16000000) :
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_c4 (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, the product of all primes with (imported from Mathlib, not defined in this file). The inequality is strict and between natural numbers, with exponentiation on both sides. Equivalently, as a real-number comparison. No other binders or typeclass assumptions are present. Edge cases: every is excluded, so the claim covers only the window ; it constrains every in that window and is not vacuous. Nothing in the text suggests it 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.