Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Bertrand's_theorem
gptkb:Bertrand–Chebyshev_theorem |
| gptkbp:category |
theorems about prime numbers
|
| gptkbp:field |
number theory
|
| gptkbp:formedBy |
gptkb:Joseph_Bertrand
1845 |
| gptkbp:generalizes |
Ramanujan's theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Bertrand's postulate
|
| gptkbp:implies |
there is always a prime between n and 2n for n > 1
|
| gptkbp:influenced |
distribution of prime numbers
|
| gptkbp:namedAfter |
gptkb:Joseph_Bertrand
|
| gptkbp:provenBy |
gptkb:Pafnuty_Chebyshev
|
| gptkbp:relatedTo |
prime numbers
|
| gptkbp:sentence |
For every integer n > 1, there is always at least one prime p such that n < p < 2n.
|
| gptkbp:yearProved |
1850
|
| gptkbp:bfsParent |
gptkb:Euclid's_theorem
gptkb:Ramanujan_prime gptkb:Joseph_Bertrand |
| gptkbp:bfsLayer |
6
|