Abstract
We obtain an asymptotic formula for the average value of the divisor function over the integers n≤x in an arithmetic progression n≡amodq, where q=pk for a prime p≥3 and a sufficiently large integer k. In particular, we break the classical barrier q≤x2/3−ε (with an arbitrary ε>0) for such formulas, and, using some new arguments, generalise and strengthen a recent result of R. Khan (2015), making it uniform in k.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
