Further results on a generalization of Bertrand's postulate (Q1907704)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Further results on a generalization of Bertrand's postulate |
scientific article; zbMATH DE number 844405
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Further results on a generalization of Bertrand's postulate |
scientific article; zbMATH DE number 844405 |
Statements
Further results on a generalization of Bertrand's postulate (English)
0 references
13 February 1996
0 references
Let \(d(k)\) be the least positive integer \(n\) for which \(p_{n+1} < 2p_n-k\). The prime number theorem implies that \(d(k)\) is equivalent to \(k/ \log k\). It is proved in this paper, among other things, that \(d(k) < k/(\log k-2.531)\) for \(k \geq 286664\).
0 references
Bertrand's postulate
0 references
primes
0 references
