The prime number theorem via the large sieve

DOI10.1112/S002557930001384XzbMath0575.10036MaRDI QIDQ3695345

Adolf Hildebrand

Publication date: 1986

Published in: Mathematika (Search for Journal in Brave)

zbMATH Keywords

upper boundprime number theoremSelberg's sieveelementary prooflarge sieve inequalitynumber of primes in short intervals

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Distribution of primes (11N05) Sieves (11N35)

Related Items (5)

Erdős and the integers ⋮ Une démonstration élémentaire du théorème des idéaux premiers «via une inégalité du type grand crible» ⋮ Hardy, Littlewood and probability ⋮ A new elementary proof of the Prime Number Theorem ⋮ Jonas Kubilius and genesis of probabilistic number theory

Cites Work

• An elementary proof of the prime-number theorem
• On Wirsing's mean value Theorem for Multiplicative Functions
• Elementary methods in the study of the distribution of prime numbers
• On a New Method in Elementary Number Theory Which Leads to An Elementary Proof of the Prime Number Theorem

This page was built for publication: The prime number theorem via the large sieve