Dusart, P. (1999). The kth prime is greater than k(ln k + ln ln k − 1) for k ≥ 2. Mathematics of Computation, 68(225), 411–415. https://doi.org/10.1090/S0025-5718-99-01037-6
The kth prime is greater than k(ln k + ln ln k − 1) for k ≥ 2. Mathematics of Computation
—
by