Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rosser–Schoenfeld (1962), Theorem 33: totient bound via primorial

Proved
TaoFivePrimes.rosser_schoenfeld_totient_theorem33

by andreaskapfer · 1 vote · Sep 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorynumber-theorytotient

Rosser--Schoenfeld (1962), Theorem 33. Let x≥5x \ge 5x≥5 be a real number and n≥1n \ge 1n≥1 an integer with

n<eθ(x),n < e^{\theta(x)},n<eθ(x),

where θ(x)=∑p≤xlog⁡p\theta(x) = \sum_{p \le x} \log pθ(x)=∑p≤x​logp is the first Chebyshev function (the sum over primes p≤xp \le xp≤x). Then

nφ(n)  ≤  ∏p≤x−2pp−1,\frac{n}{\varphi(n)} \;\le\; \prod_{p \le x-2} \frac{p}{p-1},φ(n)n​≤p≤x−2∏​p−1p​,

where φ\varphiφ is Euler's totient function and the product is over all primes p≤⌊x−2⌋p \le \lfloor x-2 \rfloorp≤⌊x−2⌋.

This is the comparison theorem that transfers information about Chebyshev's θ\thetaθ function into a bound for the primorial-type product ∏p≤x−2p/(p−1)\prod_{p \le x-2} p/(p-1)∏p≤x−2​p/(p−1), which dominates n/φ(n)n/\varphi(n)n/φ(n) whenever n<eθ(x)n < e^{\theta(x)}n<eθ(x). 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 TaoFivePrimes
Source
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

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me