← All problems

Folklore conjecture on multiplicative exponential sums

For every multiplicative function f:N→Cf:\mathbb{N}\to\mathbb{C} with ∣f(n)∣≤1|f(n)|\le 1 for all nn, every N≥3N\ge 3, every integer q≥1q\ge 1, every integer aa with (a,q)=1(a,q)=1, and every α∈R\alpha\in\mathbb{R} satisfying ∣α−a/q∣≤q−2|\alpha-a/q|\le q^{-2} and q≤N/(log⁡N)2q\le N/(\log N)^2, one has

∑n≤Nf(n)e⁡(nα)≪Nlog⁡N+Nq,\sum_{n\le N} f(n)\operatorname{e}(n\alpha)\ll \frac{N}{\log N}+\frac{N}{\sqrt{q}},

where e⁡(t)=exp⁡(2πit)\operatorname{e}(t)=\exp(2\pi i t) and the implied constant is absolute.

References

Progress summary

Refreshed
Open · progress reported

A long-standing estimate has substantial partial proofs, but the full statement remains open because the latest stronger claims have not been independently checked.

The conjecture concerns a uniform bound for exponential sums with 11-bounded multiplicative coefficients, classically associated with Montgomery and Vaughan (1977). Its expected scale is xlog⁡x+xq\frac{x}{\log x}+\frac{x}{\sqrt q} when α\alpha is well approximated by a/qa/q.

Known results

  • Montgomery and Vaughan (1977) established foundational bounds for exponential sums with multiplicative coefficients.
  • de la Bretèche and Granville proved substantial major-arc classification and bounds, including the necessity of the x/qx/\sqrt q term.
  • Robles (September 10, 2026) improved logarithmic factors under additional hypotheses, without claiming the full conjecture.

Recent partial claims

A 2026 preprint claims the main bound is proved except possibly in the range q=(log⁡x)2+o(1)q=(\log x)^{2+o(1)}, with that range covered when ϕ(q)≫q\phi(q)\gg q; it also formulates stronger smooth-number and logarithmically weighted conjectures and proves weaker estimates. These claims are unverified.

Current status (as of October 2026): Substantial ranges and partial estimates are established, but the full conjecture remains open because recent stronger claims lack independent verification.

Sources

Solutions 0

No solutions have been posted yet.