The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
Author:
- 1 January 1999
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 68 (225) , 411-415
Abstract
Rosser and Schoenfeld have used the fact that the first 3,500,000 zeros of the Riemann zeta function lie on the critical line to give estimates on ψ ( x ) \psi (x) and θ ( x ) \theta (x) . With an improvement of the above result by Brent et al. , we are able to improve these estimates and to show that the k t h k^{th} prime is greater than k ( ln k + ln ln k − 1 ) k(\ln k +\ln \ln k -1) for k ≥ 2 k\geq 2 . We give further results without proof.Keywords
This publication has 9 references indexed in Scilit:
- Bornes effectives pour certaines fonctions concernant les nombres premiersJournal de Théorie des Nombres de Bordeaux, 1996
- On the Zeros of the Riemann Zeta Function in the Critical Strip. IVMathematics of Computation, 1986
- CorrigendaMathematics of Computation, 1986
- On the Zeros of the Riemann Zeta Function in the Critical Strip. IIMathematics of Computation, 1982
- Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de nActa Arithmetica, 1982
- Approximate formulas for some functions of prime numbersIllinois Journal of Mathematics, 1962
- Explicit Bounds for Some Functions of Prime NumbersAmerican Journal of Mathematics, 1941
- Über eine Minimalaufgabe im Gebiete der analytischen Funktionen von mehreren VeränderlichenMonatshefte für Mathematik, 1939
- The n -th Prime is Greater than n lognProceedings of the London Mathematical Society, 1939