Explicit primorial bound for
ProvedPrimorialRange.bound_34129386_42496200explicit-boundsfinite-certificatesnumber-theory
Let denote the primorial of a natural number , and let be the first Chebyshev function. For every natural number satisfying ,
or equivalently throughout this range.
This finite-range primorial inequality forms one of eight consecutive subranges partitioning , used to assemble the explicit Chebyshev bound needed in the ternary Goldbach estimates of Liu and Wang (2002).
Preamble
import Mathlib.NumberTheory.Primorial
Formal statement
namespace PrimorialRange
theorem bound_34129386_42496200 (n : ℕ) (hn : 34129386 < n) (hn' : n ≤ 42496200) :
primorial n * 25 ^ n < 68 ^ n := by sorry
end PrimorialRangeSource
L. Schoenfeld, Sharper bounds for the Chebyshev functions theta(x) and psi(x). II, Math. Comp. 30 (1976), 337-360, p. 356, display 5.1*; M.-C. Liu and T. Wang, On the Vinogradov bound in the three primes Goldbach conjecture, Acta Arith. 105 (2002), 133-175.