Further results on a generalization of Bertrand's postulate

George Giordano

International Journal of Mathematics and Mathematical Sciences, 1996, vol. 19, 1-11

Abstract:

Let d ( k ) be defined as the least positive integer n for which p n + 1 < 2 p n − k . In this paper we will show that for k ≥ 286664 , then d ( k ) < k / ( log k − 2.531 ) and for k ≥ 2 , then k ( 1 − 1 / log k ) / log k < d ( k ) . Furthermore, for k sufficiently large we establish upper and lower bounds for d ( k ) .

Date: 1996
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/19/328171.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/19/328171.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:328171

DOI: 10.1155/S0161171296000129

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().