Further results on a generalization of Bertrand's postulate
Let d(k) be defined as the least positive integer n for which pn+1<2pn−k. In this paper we will show that for k≥286664, then d(k)<k/(logk−2.531) and for k≥2, then k(1−1/logk)/logk<d(k). Furthermore, for k sufficiently large we establish upper and lower bounds for d(k).
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1996-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171296000129 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|