In 1977 Montgomery and Vaughan gave tight bounds for exponential sums of the form where is a -bounded multiplicative function and , close to the conjectured where is best approximated by , showing their results to be best-possible'' by observing that the first part of their bound is more-or-less attained when $f(n)=χ(n), α=\frac aq$ where $χ$ is a primitive character mod $q$, and the second part when $f(p)=e(-αp)$ for all large primes $p$. La Bretèche and Granville proved that when $α$ lies on a major arc the exponential sum is significantly smaller unless $f$ pretends to be’’ for some character and real number ; and herein we prove that when lies on a minor arc, the exponential sum is significantly smaller unless pretends to be for primes for some bounded integer . We also study exponential sums restricted to -smooth (or -friable) integers . We conjecture that this sum is in a wide range of parameters, show that if true this is best possible, and prove an upper bound in a wide range that is only slightly weaker than the conjecture. Finally we study the logarithmically weighted exponential sums . We conjecture that this sum is in a wide range of parameters, show that if true this is best possible, and prove an upper bound in a wide range that is only slightly weaker than the conjecture. Along the way, we will prove various technical results about multiplicative functions which may be of use elsewhere.

生成讲解博客的中文版本

生成AI智能校验的中文版本