Divisor problem in arithmetic progressions modulo a prime power

From MaRDI portal




Abstract: We obtain an asymptotic formula for the average value of the divisor function over the integers nlex in an arithmetic progression nequivapmodq, where q=pk for a prime pge3 and a sufficiently large integer k. In particular, we break the classical barrier qlex2/3 for such formulas, and generalise a recent result of R.~Khan (2015), making it uniform in k.




Cited in
(27)






This page was built for publication: Divisor problem in arithmetic progressions modulo a prime power

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688638)