2000 character limit reached
Odd moments and adding fractions (2312.09021v1)
Published 14 Dec 2023 in math.NT
Abstract: We prove near-optimal upper bounds for the odd moments of the distribution of coprime residues in short intervals, confirming a conjecture of Montgomery and Vaughan. As an application we prove near-optimal upper bounds for the average of the refined singular series in the Hardy-Littlewood conjectures concerning the number of prime $k$-tuples for $k$ odd. The main new ingredient is a near-optimal upper bound for the number of solutions to $\sum_{1\leq i\leq k}\frac{a_i}{q_i}\in \mathbb{Z}$ when $k$ is odd, with $(a_i,q_i)=1$ and restrictions on the size of the numerators and denominators, that is of independent interest.