The non-coprime part of is
ProvedVino.sum_vonMangoldt_not_coprime_leanalytic-number-theorycircle-methodnumber-theoryprime-numbers
Let and . Then
where is the number of distinct prime factors of .
This is the estimate that disposes of the error term in the major-arc identity. Only prime powers contribute to a von Mangoldt sum, and a prime power sharing a factor with must be a power of one of the primes dividing ; each such prime contributes at most . Since , the whole term is — negligible against the main term on any reasonable major arc.
Preamble
import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt import Mathlib.Data.Nat.Factorization.PrimePow import Mathlib.Data.Nat.Log import Mathlib.Analysis.SpecialFunctions.Log.Basic open Finset
Formal statement
namespace Vino
theorem sum_vonMangoldt_not_coprime_le {q : ℕ} (hq : 0 < q) {N : ℕ} (hN : N ≠ 0) :
∑ n ∈ (Finset.range N).filter (fun n => ¬ Nat.Coprime n q),
(ArithmeticFunction.vonMangoldt n : ℝ)
≤ (q.primeFactors.card : ℝ) * Real.log N := by sorry
end VinoSource
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Chapter 3, Sections 3.1-3.2 (the three primes theorem).