加载中…
We prove a folklore conjecture on exponential sums with multiplicative coefficients: if is multiplicative with , , and , then Complete multiplicativity is not required. We also prove two related conjectured bounds: the refinement in which is replaced by , when this quantity is at most , and the corresponding bound for the sum with logarithmic weights. Finally, we show that the bound can fail for multiplicative satisfying only at primes and , for every fixed .

生成讲解博客的中文版本

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