The divisor function in arithmetic progressions modulo prime powers

From MaRDI portal
Publication:2827922




Abstract: We study the average value of the divisor function au(n) for nlex with . The divisor function is known to be evenly distributed over arithmetic progressions for all q that are a little smaller than x2/3. We show how to go past this barrier when q=pk for odd primes p and any fixed integer kge7.









This page was built for publication: The divisor function in arithmetic progressions modulo prime powers

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