The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2

From MaRDI portal
Publication:4221991

DOI10.1090/S0025-5718-99-01037-6zbMath0913.11039WikidataQ55898691 ScholiaQ55898691MaRDI QIDQ4221991

Pierre Dusart

Publication date: 3 December 1998

Published in: Mathematics of Computation (Search for Journal in Brave)




Related Items (62)

El problema de las jaulas y los polígonos generalizadosOn Ramanujan primesOn the number of total prime factors of an odd perfect numberBounded gaps between primes in Chebotarev setsOn generalized Ramanujan primesON THE RATIO OF CONSECUTIVE PRIMESPrimes and the Lambert \(W\) functionOn sums of sparse prime subsetsA new theorem on the prime-counting functionOn the products \((1^{3}+q^{3})(2^{3}+q^{3})\cdots (n^{3}+q^{3})\)On efficient sparse integer matrix Smith normal form computationsComplete subgraphs of the coprime hypergraph of integers. I: Introduction and boundsOn the products \((1^\ell + 1)(2^\ell + 1)\cdots(n^\ell + 1)\). IIUnnamed ItemAutomorphism Orbits and Element Orders in Finite Groups: Almost-Solubility and the MonsterOperational state complexity of unary NFAs with finite nondeterminismCircling the uniform distributionPartial linear spaces and identifying codesExplicit estimates of some functions over primesOn the sum of the first \(n\) prime numbersCensus algorithms for chinese remainder pseudorankConvergence to scale-invariant Poisson processes and applications in Dickman approximationOn the arithmetic dimension of triangle groupsUnnamed ItemPowerful numbers in \((1^k +1)(2^k+1) \cdots (n^k +1)\)On functions taking only prime valuesExplicit counting of ideals and a Brun–Titchmarsh inequality for the Chebotarev density theoremThe \(n\)-th prime asymptoticallyLarge values of the number of factorizations of an integer as an ordered product of primesArithmetical properties of a sequence arising from an arctangent sumOn Romanoff's constantThe largest prime factor of Landau's functionMaximal product of primes whose sum is boundedRegular graphs of large girth and arbitrary degreeOn a divisibility problemOn extended Eulerian numbersBounded gaps between products of distinct primesBertrand's postulate, the prime number theorem and product anti-magic graphsEstimates of the \(k\)th prime under the Riemann hypothesisUnnamed ItemOn the primality of $n! \pm 1$ and $2 \times 3 \times 5 \times \dotsm \times p \pm 1$Another proof on the existence of Mertens's constantUnnamed ItemDispersing hash functionsOn a conjecture of Erdős, Graham and SpencerPrime gaps and the Firoozbakht conjectureOn the arithmetic and geometric means of the first \(n\) prime numbersNew estimates for the $n$th prime numberPatterns of primes in the Sato-Tate conjecturePrime powers dividing products of consecutive integer values of \(x^{2^n}+1\)The Sheldon ConjectureIntegers with a given number of divisorsOn the dimension spectrum of infinite subsystems of continued fractionsUnary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\)Landau's function for one million billionsEstimating the counts of Carmichael and Williams numbers with small multiple seedsRobin's criterion on divisibilityIncreasing integer sequences and Goldbach's conjectureON A SEQUENCE INVOLVING SUMS OF PRIMESOn the smallest number with a given number of divisorsOn upper bounds and connectivity of cagesOn the Erdős covering problem: the density of the uncovered set



Cites Work


This page was built for publication: The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2