Further results on a generalization of Bertrand's postulate
type: Item
instance of: scholarly article
title: Further results on a generalization of Bertrand's postulate
zbMATH Open document ID: 0857.11045
DOI: 10.1155/S0161171296000129
author: George Giordano
published in: International Journal of Mathematics and Mathematical Sciences
publication date: 1996-02-13T00:00:00Z
full work available at URL: https://eudml.org/doc/47589
review text: 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\).
Mathematics Subject Classification ID: 11N05
Mathematics Subject Classification ID: 11A41
zbMATH DE Number: 844405
zbMATH Keywords: Bertrand's postulate
zbMATH Keywords: primes
reviewed by: Cătălin Badea
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 844405