×

General divisor functions in arithmetic progressions to large moduli. (English) Zbl 1351.11059

Summary: We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.

MSC:

11N25 Distribution of integers with specified multiplicative constraints
11N37 Asymptotic results on arithmetic functions
11B25 Arithmetic progressions

References:

[1] Bombieri E, Friedlander J B, Iwaniec H. Primes in arithmetic progressions to large moduli. Acta Math, 1986, 156: 203-251 · Zbl 0588.10042 · doi:10.1007/BF02399204
[2] Friedlander J B, Iwaniec H. The divisor problem for arithmetic progressions. Acta Arith, 1985, 45: 273-277 · Zbl 0572.10033
[3] Granville A. Primes in intervals of bounded length. Bull Amer Math Soc, 2015, 52: 171-222 · Zbl 1319.11064 · doi:10.1090/S0273-0979-2015-01480-1
[4] Heath-Brown D R. The divisor function d3(n) in arithmetic progressions. Acta Arith, 1986, 47: 29-56 · Zbl 0549.10034
[5] Hooley C. An asymptotic formula in the theory of numbers. Proc London Math Soc, 1957, 7: 396-413 · Zbl 0079.27301 · doi:10.1112/plms/s3-7.1.396
[6] Linnik Y V. All large numbers are sums of a prime and two squares (a problem of Hardy and Littlewood) II. Mat Sb, 1961, 53: 3-38
[7] Polymath D H J. New equidistribution estimates of Zhang type. Algebra Number Theory, 2014, 8: 2067-2199 · Zbl 1307.11097 · doi:10.2140/ant.2014.8.2067
[8] Zhang Y. Bounded gaps between primes. Ann of Math, 2014, 179: 1121-1174 · Zbl 1290.11128 · doi:10.4007/annals.2014.179.3.7
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.