The n -th Prime is Greater than n logn

DOI10.1112/plms/s2-45.1.21zbMath0019.39401OpenAlexW1968126383MaRDI QIDQ5771233

J. Barkley Rosser

Publication date: 1938

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s2-45.1.21

zbMATH Keywords

distribution of prime numbers

Mathematics Subject Classification ID

Distribution of primes (11N05)

Related Items

On the Oesterlé-Masser conjecture ⋮ Primes and the Lambert \(W\) function ⋮ On thenth composite number ⋮ Lucas non-Wieferich primes in arithmetic progressions ⋮ Unambiguous finite automata over a unary alphabet ⋮ On the sum of the first \(n\) prime numbers ⋮ Bounds for the counting function of the Jordan-Pólya numbers ⋮ On a Lehmer problem concerning Euler's totient function ⋮ Truncated convolution of the M\xF6bius function and multiplicative energy of an integer $n$ ⋮ THE NEW UNIVERSAL ESTIMATION FOR EXPONENTS OF GRAPHS ⋮ An explicit zero-free region for the Riemann zeta-function ⋮ Another proof on the existence of Mertens's constant ⋮ The zeros of the Riemann zeta-function ⋮ Prime gaps and the Firoozbakht conjecture ⋮ Neuere Untersuchungen über die Jacobsthal-Funktion g(n) ⋮ A new upper bound for the cross number of finite Abelian groups. ⋮ Über eine zahlentheoretische Funktion von Jacobsthal ⋮ Le critére de Beurling et Nyman pour I'hypothése de Riemann: aspects numériques ⋮ Linearizing torsion classes in the Picard group of algebraic curves over finite fields ⋮ Über gewisse Extremaleigenschaften positiver trigonometrischer Polynome ⋮ ON THE LARGEST PRIME FACTOR OF THE k-FIBONACCI NUMBERS ⋮ Unnamed Item ⋮ On terms in a dynamical divisibility sequence having a fixed g.c.d with their indices ⋮ ON A SEQUENCE INVOLVING SUMS OF PRIMES ⋮ On rational approximations with denominators from thin sets. II.

This page was built for publication: The n -th Prime is Greater than n logn