ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let χ\chi be a non-principal character modulo qq, let 1⩽x⩽min⁡{q,T}1\leqslant x\leqslant\min\{q,T\}, and let 2T⩽t⩽5T2T\leqslant t\leqslant5T. Write χ0\chi_0 for the principal character modulo qq, and let P+(n)P^{+}(n) denote the largest prime factor of nn.

Mixed conjecture. There exists a constant A>0A>0 such that, uniformly in these ranges,

∑n⩽xχ(n)nit=∑n⩽xP+(n)⩽yχ(n)nit+o(Ψ(x,y;χ0)),as q→∞, T→∞,\sum_{n\leqslant x}\frac{\chi(n)}{n^{it}}=\sum_{\substack{n\leqslant x\\P^{+}(n)\leqslant y}}\frac{\chi(n)}{n^{it}}+o\bigl(\Psi(x,y;\chi_0)\bigr),\qquad\text{as }q\to\infty,\ T\to\infty,

where y=(log⁡(qT)+log⁡2x)(log⁡2(qT))Ay=(\log(qT)+\log^2x)(\log_2(qT))^A.

This combines the character-sum and oscillatory smooth-approximation conjectures. The source gives no evidence of a proof or disproof.

Record

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.