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

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

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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 1, 2, 3, 5, 9, 14 and no others, at least for k ≤ 100, 000, 000. Moreover, for every known k in this list, we give a good upper bound for the smallest Nk(m), such that if n ≥ Nk(m), then the interval (kn, (k + 1)n) contains at least m primes.

Original languageEnglish
JournalJournal of Integer Sequences
Volume16
Issue number7
StatePublished - 1 Jan 2013

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'On intervals (kn, (k + 1)n) containing a prime for all n > 1'. Together they form a unique fingerprint.

Cite this