The divisor function in arithmetic progressions modulo prime powers

From MaRDI portal
Publication:2827922

DOI10.1112/S0025579316000024zbMATH Open1396.11115arXiv1510.03377OpenAlexW3103709683MaRDI QIDQ2827922FDOQ2827922


Authors: Rizwanur Khan Edit this on Wikidata


Publication date: 21 October 2016

Published in: Mathematika (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1510.03377




Recommendations



Cites Work


Cited In (20)





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)