ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a real number x≥2x\ge 2 let li⁡x=∫2xdtlog⁡t\operatorname{li} x=\int_{2}^{x}\frac{dt}{\log t}, let φ\varphi denote Euler's totient function, and for a positive integer qq and an integer hh with (h,q)=1(h,q)=1 let

π(x;q,h)=#{p≤x: p prime, p≡h(modq)}.\pi(x;q,h)=\#\{p\le x:\ p\ \text{prime},\ p\equiv h \pmod q\}.

For every real A>0A>0 there exists a constant C(A)>0C(A)>0 such that for all x≥2x\ge 2 and all real XX with 1≤X<x(log⁡x)−A−11\le X<x(\log x)^{-A-1},

∑q≤Xφ(q)max⁡(h,q)=1(π(x;q,h)−li⁡xφ(q))2≤C(A) x2log⁡Ax,\sum_{q\le X}\varphi(q)\max_{(h,q)=1}\left(\pi(x;q,h)-\frac{\operatorname{li} x}{\varphi(q)}\right)^{2}\le C(A)\,\frac{x^{2}}{\log^{A}x},

the maximum being taken over all residue classes hh modulo qq with (h,q)=1(h,q)=1, and the constant C(A)C(A) depending only on AA and in particular being independent of xx and XX.

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.