Soundararajan's conjecture on smooth numbers in arithmetic progressions

Let P(n)P(n) denote the largest prime factor of nn, with P(1)=1P(1)=1, and call nn yy-smooth when P(n)yP(n)\le y. Write S(x,y)\mathcal{S}(x,y) for the yy-smooth numbers at most xx, and define

Ψ(x,y;q,a)=nS(x,y)namodq1,\Psi(x,y;q,a)=\sum_{\substack{n\in\mathcal{S}(x,y)\\ n\equiv a\bmod q}}1,

and

Ψq(x,y)=nS(x,y)(n,q)=11.\Psi_q(x,y)=\sum_{\substack{n\in\mathcal{S}(x,y)\\ (n,q)=1}}1.

For (a,q)=1(a,q)=1, the expected equidistribution relation is

Ψ(x,y;q,a)Ψq(x,y)φ(q).\Psi(x,y;q,a)\sim\frac{\Psi_q(x,y)}{\varphi(q)}.

Soundararajan's conjecture. For any fixed value of A>0A>0, if qq is sufficiently large, depending only on AA, with qyAq\le y^A and (a,q)=1(a,q)=1, then

Ψ(x,y;q,a)Ψq(x,y)φ(q)\Psi(x,y;q,a)\sim\frac{\Psi_q(x,y)}{\varphi(q)}

as logx/logq\log x/\log q\to\infty. The conjecture concerns the distribution of smooth numbers among reduced residue classes. Granville established it for A<1A<1; the general assertion was proved in the paper, and its proof would imply Vinogradov's conjecture that the least quadratic nonresidue modulo pp has size po(1)p^{o(1)}.

Sources & referencesView supporting material

Primary source

William Banks and Igor Shparlinski, “On a conjecture of Soundararajan”, arXiv:2009.06800 (2020).

Additional references

2 papers in this index state this conjecture (2011–2020). The statement above is taken from the most recent of them; the others are arXiv:1103.2106.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.