The n -th Prime is Greater than n log n

1939/01/01 by Barkley Rosser · 6 citations
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #History and Theory of Mathematics

paper · doi:10.1112/plms/s2-45.1.21

crossref issued 1939/01/01 · crossref published 1939/01/01 · crossref published-print 1939/01/01 · openalex publication_date 1939/01/01 · crossref created 2007/02/14 · crossref published-online 2016/12/23 · crossref deposited 2021/07/21 · openalex created_date 2025/10/10 · crossref indexed 2026/07/08 · openalex updated_date 2026/07/08

Cited by

• The 𝑘^𝑡ℎ prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
• The pseudoprimes to 25⋅10⁹
• On the Oesterl�-Masser conjecture
• On the abc Conjecture in Algebraic Number Fields
• The n-th prime exponentially
• Rosser's theorem [wikipedia]