Bertrand's postulate

E1094038 UNEXPLORED

Bertrand's postulate is a theorem in number theory stating that for every integer n > 1 there is always at least one prime number strictly between n and 2n.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Bertrand's postulate canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Ramanujan prime → relatedTo → Bertrand's postulate ⓘ