Divisor problem in arithmetic progressions modulo a prime power
Preprint
Abstract
We obtain an asymptotic formula for the average value of the divisor function over the integers $n \le x$ in an arithmetic progression $n \equiv a \pmod q$, where $q=p^k$ for a prime $p\ge 3$ and a sufficiently large integer $k$. In particular, we break the classical barrier $q \le x^{2/3}$ for such formulas, and generalise a recent result of R.~Khan (2015), making it uniform in $k$.
Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- THE DIVISOR FUNCTION IN ARITHMETIC PROGRESSIONS MODULO PRIME POWERSMathematika, 2016
- The Divisor Function in Arithmetic Progressions to Smooth ModuliInternational Mathematics Research Notices, 2014
- ON THE EXPONENT OF DISTRIBUTION OF THE TERNARY DIVISOR FUNCTIONMathematika, 2014
- On a variance of Hecke eigenvalues in arithmetic progressionsJournal of Number Theory, 2012
- THE AVERAGE VALUE OF DIVISOR SUMS IN ARITHMETIC PROGRESSIONSThe Quarterly Journal of Mathematics, 2007
- The divisor function over arithmetic progressionsActa Arithmetica, 1992
- Sur le problème des diviseurs de Titchmarsh.Journal für die reine und angewandte Mathematik (Crelles Journal), 1985
- Incomplete Kloosterman Sums and a Divisor ProblemAnnals of Mathematics, 1985
- The divisor problem for arithmetic progressionsActa Arithmetica, 1985
- ON THE NUMBER OF SOLUTIONS OF AN $ n$TH DEGREE CONGRUENCE WITH ONE UNKNOWNMathematics of the USSR-Sbornik, 1980