Rosser–Schoenfeld (1962), Theorem 33: totient bound via primorial
ProvedTaoFivePrimes.rosser_schoenfeld_totient_theorem33analytic-number-theorynumber-theorytotient
Rosser--Schoenfeld (1962), Theorem 33. Let be a real number and an integer with
where is the first Chebyshev function (the sum over primes ). Then
where is Euler's totient function and the product is over all primes .
This is the comparison theorem that transfers information about Chebyshev's function into a bound for the primorial-type product , which dominates whenever . It is Theorem 33 in §9 of the source, used in the proof of Lemma 15.
Preamble
import Mathlib.Data.Nat.Totient import Mathlib.NumberTheory.Chebyshev import Mathlib.NumberTheory.PrimeCounting
Formal statement
namespace TaoFivePrimes
theorem rosser_schoenfeld_totient_theorem33 (x : ℝ) (n : ℕ) (hx : 5 ≤ x) (hn : 1 ≤ n)
(h : (n : ℝ) < Real.exp (Chebyshev.theta x)) :
(n : ℝ) / Nat.totient n ≤
∏ p ∈ Nat.primesLE ⌊x - 2⌋₊, (p : ℝ) / ((p : ℝ) - 1) := by sorry
end TaoFivePrimesSource
J.B. Rosser, L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64–94; §9, pp. 88–89, Theorem 33. https://doi.org/10.1215/ijm/1255631807