Ramaré's bound for the squarefree totient sum
ProvedTaoFivePrimes.ramare_squarefree_totient_sum_leadditive-number-theorynumber-theoryprime-pairssieve-methodstao-five-primes
For every , the sum of over squarefree with satisfies
This is Ramaré's Lemma 3.5, used by Tao in the proof of Proposition 4.10. In the formal statement the indicator is the condition Squarefree n, written as a finite sum over the interval .
Preamble
import Mathlib.Data.Nat.Totient import Mathlib.Data.Nat.Squarefree import Mathlib.Analysis.SpecialFunctions.Log.Base open scoped BigOperators
Formal statement
namespace TaoFivePrimes
theorem ramare_squarefree_totient_sum_le (N : ℕ) (hN : 1 ≤ N) :
(∑ n ∈ Finset.Icc 1 N,
if Squarefree n then (1 : ℝ) / Nat.totient n else 0) ≤
Real.log (N : ℝ) + 1.4709 := by sorry
end TaoFivePrimesSource
O. Ramaré, *On Shnirel'man's constant*, Annali della Scuola Normale Superiore di Pisa, Classe di Scienze (4) 22 (1995), 645–706, Lemma 3.5, http://www.numdam.org/item/ASNSP_1995_4_22_4_645_0/; used in T. Tao, *Every odd number greater than 1 is the sum of at most five primes*, arXiv:1201.6656, https://arxiv.org/abs/1201.6656, proof of Proposition 4.10.