On intervals (kn, (k + 1)n) containing a prime for all n > 1

MaRDI QIDQ5404335zbMATH OpenFDO

Authors Vladimir Shevelev, Charles R. Greathouse IV, Peter J. C. Moses

Publication date 24 March 2014

Full work available at URL https://arxiv.org/abs/1212.2785, http://www.emis.de/journals/JIS/VOL16/Moses/moses1.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

generalized Ramanujan primeprime number

Mathematics Subject Classification ID

Primes (11A41)

Abstract: We study values of k for which the interval (kn,(k+1)n) contains a prime for every n>1. We prove that the list of such integers k includes k=1,2,3,5,9,14, and no others, at least for k<=50,000,000. For every known k of this list, we give a good upper estimate of the smallest N_k(m), such that, if n>=N_k(m), then the interval (kn,(k+1)n) contains at least m primes.

Recommendations

• Primes in the interval [2n,3n]
• Short intervals containing a prescribed number of primes
• Short intervals almost all containing primes
• Short intervals with a given number of primes
• Short effective intervals containing primes

Cited in

(7)

• On the estimates of the upper and lower bounds of Ramanujan primes
• Counting primes in the quadratic intervals
• Are all Primes 32k + 17(k > 0) Square Separable
• Explicit interval estimates for prime numbers
• Bounded length intervals containing two primes and an almost-prime
• On the interval containing at least one prime number
• Generalizations of Bertrand’s Postulate to Sums of Any Number of Primes

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: On intervals \((kn, (k + 1)n)\) containing a prime for all \(n > 1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404335)