The primorial bound n# < 4^n
ProvedFamousTheorems.primorial_lt_four_pow_boundThe primorial bound . For every , the product of all primes at most satisfies
This elementary bound is due to Erdős, via central binomial coefficients: primes in divide . It is equivalent to Chebyshev's bound and is used in Erdős's proof of Bertrand's postulate.
Formalization note. Mathlib's primorial_lt_four_pow. primorial n is the product of the primes .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems theorem primorial_lt_four_pow_bound (n : ℕ) (hn : n ≠ 0) : primorial n < 4 ^ n := by sorry end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `primorial_lt_four_pow`. Proof here reduces to that Mathlib result.