ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n∈Z≥1n\in\mathbb{Z}_{\geq 1} let Λ(n)=log⁡p\Lambda(n)=\log p if n=pkn=p^{k} for some prime pp and integer k≥1k\geq 1, and Λ(n)=0\Lambda(n)=0 otherwise, and let φ\varphi denote the Euler totient function. For real y≥0y\geq 0 and integers q≥1q\geq 1, aa, put

ψ(y;q,a)=∑n≤yn≡a mod qΛ(n).\psi (y;q,a)=\sum _{n\leq y \atop n\equiv a{\bmod {q}}}\Lambda (n).

Let A>0A>0. Then there is a constant C=C(A)C=C(A) such that for all real x≥2x\geq 2 and all real QQ with

x1/2log⁡−Ax≤Q≤x1/2,x^{1/2}\log ^{-A}x\leq Q\leq x^{1/2},

one has

∑q≤Q max⁡y≤x max⁡1≤a≤q(a,q)=1∣ψ(y;q,a)−yφ(q)∣ ≤ C x1/2Q(log⁡x)5,\sum _{q\leq Q}\ \max _{y\leq x}\ \max _{1\leq a\leq q \atop (a,q)=1}\left|\psi (y;q,a)-{y \over \varphi (q)}\right|\ \leq \ C\,x^{1/2}Q(\log x)^{5},

the outer sum being over integers qq with 1≤q≤Q1\leq q\leq Q.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.