The generalization and proof of Bertrand's postulate
The purpose of this paper is to show that for 0<r<1 one can determine explicitly an x0 such that ∀x≥x0, ∃ at least one prime between rx and x. This is a generalization of Bertrand's Postulate. Furthermore, the same procedures are used to show that if one can find upper and lower bounds fo...
Saved in:
Main Author: | George Giordano |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1987-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171287000917 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Further results on a generalization of Bertrand's postulate
by: George Giordano
Published: (1996-01-01) -
On the K-th extension of the Sieve of eratosthenes
by: Antonio R. Quesada
Published: (1995-01-01) -
Prime valued polynomials and class numbers of quadratic fields
by: Richard A. Mollin
Published: (1990-01-01) -
Bertrand oligopoly revisited
by: Tönu Puu
Published: (2001-01-01) -
Evolution of precipitates during creep deformation for alloy 718
by: Chanhee Park, et al.
Published: (2025-01-01)