19
$\begingroup$

In Wikipedia's page for Bertrand's postulate, it is said that its (2n,3n) version was proved by El Bachraoui in 2006. Seems likely that it was first proved way before than that! Can anyone point to the first source, or at least to a previous one?

Analogously, Wikipedia said until recently that the (3n,4n) version was due to Andy Loo in 2011. I'm aware of a proof by Denis Hanson in 1973, so I have updated the page with that info, but I don't know if his proof is the first one. Do you know of previous proofs?

$\endgroup$
4
  • 1
    $\begingroup$ I haven't looked at the proofs but I'm trying to understand how they could possibly be novel. Selberg and Erdős gave elementary proofs of the PNT in 1948. So we already had all these elementary theorems for sufficiently large $n$ seventy years ago, is there some difficulty in making them effective with an elementary argument? $\endgroup$ Dec 27, 2017 at 20:49
  • 6
    $\begingroup$ references to this problem are given in arXiv:1212.2785, with the remarkable theorem: The list of integers $k$ for which every interval $(kn, (k + 1)n)$, $n > 1$, contains a prime includes $k = 1,2,3,5,9,14$ and no others $\endgroup$ Dec 27, 2017 at 21:04
  • 4
    $\begingroup$ @CarloBeenakker Looks like a great paper! Nevertheless, the references it gives are the same as the Wikipedia ones (it fails to cite Hanson's work, for example). Besides, it is not for every $k$, just for every $k<10^8$. $\endgroup$
    – Jose Brox
    Dec 27, 2017 at 21:07
  • 1
    $\begingroup$ The answers to mathoverflow.net/questions/113840/… have pertinent references. $\endgroup$
    – Tony Huynh
    Dec 28, 2017 at 19:33

2 Answers 2

24
$\begingroup$

I have finally found the following papers and results, which predate Nagura's paper of 1952. I cite them from newest to oldest:

  1. (Molsen, 1941):
    • For $n\geq 118$ there are primes in $(n,\frac43n)$ congruent to 1,5,7,11 modulo 12.
    • For $n\geq 199$ there are primes in $(n,\frac87n)$ congruent to 1,2 modulo 3. This result implies that of Nagura.

K. Molsen, Zur Verallgemeinerung des Bertrandschen Postulates, Deutsche Math. 6 (1941), 248-256. MR0017770

  1. (Breusch, 1932):
    • For $n\geq 7$ there are primes in $(n,2n)$ congruent to 1,2 modulo 3 and to 1,3 modulo 4.
    • For $n\geq 48$ there is a prime in $(n,\frac98n)$. This result implies those of Nagura and Molsen (but not the congruences part).

R. Breusch, Zur Verallgemeinerung des Bertrandschen Postulates, dass zwischen x und 2x stets Primzahlen liegen, Math. Z. 34 (1932), 505–526. MR1545270

  1. (Schur, 1929, according to Breusch in the previous paper):
    • For $n\geq 24$ there is a prime in $(n,\frac54n)$. This result already implies those of Hanson and El Bachraoui.

I. Schur, Einige Sätze über Primzahlen mit Anwendungen auf Irreduzibilitätsfragen I, Sitzungsberichte der preuss. Akad. d. Wissensch., phys.-math. Klasse 1929, S.128.

$\endgroup$
2
  • $\begingroup$ I could not locate Schur's paper. I'd be glad if someone can provide a link! $\endgroup$
    – Jose Brox
    Dec 28, 2017 at 18:44
  • 2
    $\begingroup$ Surprising and impressive find. $\endgroup$ Dec 28, 2017 at 21:34
23
$\begingroup$

EDIT: Jose Brox, in another answer, had provided references which not noly predate Nagura's result, but they are also stronger.


J. Nagura, already in 1952, proved that the interval $(x,\frac{6}{5}x)$ contains a prime for any $x \ge 25$. The proof appears in the paper "On the interval containing at least one prime number" published in Proc. Japan Acad. Volume 28, Number 4 (1952), 177-181 (see this link). From Nagura's theorem one obtains the results mentioned in your post by choosing $x=2n$ or $x=3n$, and checking what happens for small $n$.

$\endgroup$
6
  • 3
    $\begingroup$ Scooped me by 2 minutes :) $\endgroup$
    – Igor Rivin
    Dec 27, 2017 at 20:58
  • $\begingroup$ @DanBrumleve The proof uses properties of the Gamma function for a real variable only, as far as I can see. The idea of employing properties of the Gamma function (including Stirling's formula) goes back to Ramanujan's proof of Bertrand's Postulate (1919). $\endgroup$ Dec 27, 2017 at 21:06
  • $\begingroup$ Nice! Do you have any hint that this is indeed the first proof of this kind? $\endgroup$
    – Jose Brox
    Dec 27, 2017 at 21:09
  • $\begingroup$ @DanBrumleve I don't think so... Wikipedia doesn't say that they provide simple proofs, just states "this person proved this fact" (btw, as does Moser's paper linked by Carlo Beenakker in a commentary) $\endgroup$
    – Jose Brox
    Dec 27, 2017 at 21:11
  • 3
    $\begingroup$ @JoseBrox According to Google Scholar, there isn't a paper from 1952 or before citing Chebyshev's, Ramanujan's or Erdős's proofs. On the other hand, Google Scholar does not list Nagura's paper in the list of citations, so it is far from perfect. $\endgroup$ Dec 27, 2017 at 21:29

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.