Pretentious multiplicative functions and the prime number theorem for arithmetic progressions
2013 ◽
Vol 149
(7)
◽
pp. 1129-1149
◽
Keyword(s):
AbstractBuilding on the concept ofpretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
Keyword(s):
2000 ◽
Vol 157
◽
pp. 103-127
◽
Keyword(s):
1984 ◽
Vol 42
(165)
◽
pp. 265-265
◽
1949 ◽
Vol 2
(2-3)
◽
pp. 293-308
◽
1999 ◽
Vol 29
(3)
◽
pp. 979-1053
◽