arXivDaily arXiv每日学术速递 周一至周五更新
稍安勿躁,官方尚未更新
arXiv 1602.03583math.NT
收藏

Divisor problem in arithmetic progressions modulo a prime power

Kui Liu, Igor E. Shparlinski, Tianping Zhang

英文摘要:

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$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑