Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Bertrand's_postulate
|
| gptkbp:field |
number theory
|
| gptkbp:firstStatedBy |
gptkb:Joseph_Bertrand
|
| gptkbp:generalizes |
gptkb:Ramanujan_prime
|
| gptkbp:namedAfter |
gptkb:Pafnuty_Chebyshev
gptkb:Joseph_Bertrand |
| gptkbp:provenBy |
gptkb:Pafnuty_Chebyshev
|
| gptkbp:relatedTo |
gptkb:Prime_number_theorem
distribution of prime numbers prime gap |
| gptkbp:state |
for every integer n > 1, there is always at least one prime p such that n < p < 2n
|
| gptkbp:yearProved |
1850
|
| gptkbp:yearStated |
1845
|
| gptkbp:bfsParent |
gptkb:Bertrand's_postulate
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Bertrand–Chebyshev theorem
|