Divisor problem in arithmetic progressions modulo a prime power
Divisor problem in arithmetic progressions modulo a prime power
复制标题
以素数幂为模的算术级数中的除数问题
DOI:
10.1016/j.aim.2017.12.006
复制
发表时间:
2016-02
影响因子:
1.7
通讯作者:
Tianping Zhang
中科院分区:
文献类型:
--
作者:
Kui Liu;Igor Shparlinski;Tianping Zhang
We obtain an asymptotic formula for the average value of the divisor function over the integers n≤ x in an arithmetic progression n≡ a mod q, where q= p k for a prime p≥ 3 and a sufficiently large integer k. In particular, we break the classical barrier q≤ x 2/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.
登录
查看更多内容
影响因子:
2.1
作者:
H. Iwaniec;E. Kowalski
通讯作者:
H. Iwaniec;E. Kowalski
影响因子:
1
作者:
W. Banks;Roger Heath-Brown;I. Shparlinski
通讯作者:
W. Banks;Roger Heath-Brown;I. Shparlinski
影响因子:
1
作者:
Alastair James Irving
通讯作者:
Alastair James Irving
DOI:
10.1070/sm1980v037n02abeh001947
发表时间:
1980-02
期刊:
Mathematics of The Ussr-sbornik
影响因子:
--
作者:
S. V. Konjagin
通讯作者:
S. V. Konjagin
影响因子:
0.7
作者:
P. Pongsriiam;R. Vaughan
通讯作者:
P. Pongsriiam;R. Vaughan