Pretentious multiplicative functions and the prime number theorem for arithmetic progressions

被引：14
|
作者：
Koukoulopoulos, Dimitris [1 ]
机构：
[1] Univ Montreal, Dept Math & Stat, Montreal, PQ H3C 3J7, Canada
来源：
COMPOSITIO MATHEMATICA | 2013年 / 149卷 / 07期
关键词：
prime number theorem for arithmetic progressions; multiplicative functions; Halasz's theorem; elementary proofs of the prime number theorem; Siegel's theorem; ZETA-FUNCTION;
D O I：
10.1112/S0010437X12000802
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
引用
收藏
页码：1129 / 1149
页数：21
相关论文
共 50 条
12345