Elementary and combinatorial methods for counting prime numbers

DOI10.1007/S00591-017-0180-9zbMATH Open1422.11192OpenAlexW2594864653MaRDI QIDQ2408960FDOQ2408960

Authors Pascal Stumpf

Publication date 10 October 2017

Published in Mathematische Semesterberichte (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00591-017-0180-9

Mathematics Subject Classification ID

Distribution of primes (11N05)

Recommendations

• scientific article; zbMATH DE number 3057966
• A new elementary proof of the Prime Number Theorem
• scientific article; zbMATH DE number 3120123
• scientific article; zbMATH DE number 3344625
• scientific article; zbMATH DE number 1822311

Cites work

• scientific article; zbMATH DE number 3834055 (Why is no real title available?)
• scientific article; zbMATH DE number 2066394 (Why is no real title available?)
• scientific article; zbMATH DE number 1465050 (Why is no real title available?)
• scientific article; zbMATH DE number 1885141 (Why is no real title available?)
• An elementary proof of Dirichlet's theorem about primes in an arithmetic progression
• An elementary proof of the prime-number theorem
• Bounding multiplicative energy by the sumset
• Introduction to analytic and probabilistic number theory. Transl. from the 3rd French edition by Patrick D. F. Ion
• On Chebyshev-Type Inequalities for Primes
• On a New Method in Elementary Number Theory Which Leads to An Elementary Proof of the Prime Number Theorem
• PRIMES is in P

Cited in

(1)

• Efficient prime counting and the Chebyshev primes

This page was built for publication: Elementary and combinatorial methods for counting prime numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408960)