An Elementary Proof of the Prime-Number Theorem for Arithmetic Progressions

DOI10.4153/CJM-1950-007-5zbMath0036.30605MaRDI QIDQ5794728

A. Selberg

Publication date: 1950

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

elementary proofprime-number theorem for arithmetic progressions

Mathematics Subject Classification ID

Primes in congruence classes (11N13)

Related Items (23)

Über k-freie Zahlen als Summe von zwei Quadraten. (On k-free integers as sums of two squares) ⋮ On the prime number theorem for arithmetic progressions ⋮ The least common multiple of a sequence of products of linear polynomials ⋮ Legendre–Teege Quadratic Reciprocity ⋮ The Membership Problem for Hypergeometric Sequences with Quadratic Parameters ⋮ Different approaches to the distribution of primes ⋮ Computers as a novel mathematical reality. IV: The Goldbach problem ⋮ The Bateman-Horn conjecture: heuristic, history, and applications ⋮ Elementary Methods in the Theory of Primes ⋮ Legendre's theorem and quadratic reciprocity ⋮ On the existence of prime numbers in arithmetic progressions ⋮ Über die Anzahl der Gitterpunkte auf Kreisen mit quadratfreien Radienquadraten ⋮ Multiplicative functions in arithmetic progressions ⋮ Pretentiousness in analytic number theory ⋮ On arithmetic functions ⋮ Über ein Problem in der Theorie der Primzahlen ⋮ Abstract prime number theorems ⋮ Das asymptotische Verhalten von Summen über multiplikative Funktionen ⋮ AN -FUNCTION-FREE PROOF OF VINOGRADOV’S THREE PRIMES THEOREM ⋮ Elementary methods in the study of the distribution of prime numbers ⋮ UNEXPECTED AVERAGE VALUES OF GENERALIZED VON MANGOLDT FUNCTIONS IN RESIDUE CLASSES ⋮ Integers, without large prime factors, in arithmetic progressions. I ⋮ Prime number theorem for regular Toeplitz subshifts

This page was built for publication: An Elementary Proof of the Prime-Number Theorem for Arithmetic Progressions