Proof of Bertrand's postulate (Q13634063)

From Wikidata

Jump to navigation Jump to search

solved prime-number problem

edit

Language	Label	Description	Also known as
English	Proof of Bertrand's postulate	solved prime-number problem

Statements

defining formula

${\displaystyle {\frac {4^{n}}{2n}}\leq {\binom {2n}{n}}}$

1 reference

imported from Wikimedia project

English Wikipedia

maintained by WikiProject

WikiProject Mathematics

0 references

Identifiers

Freebase ID

/m/01lq11

0 references

Microsoft Academic ID

2776082214

0 references

 

Sitelinks

Wikipedia(2 entries)

edit

• enwiki Proof of Bertrand's postulate
• itwiki Dimostrazione del postulato di Bertrand

Wikibooks(0 entries)

edit

Wikinews(0 entries)

edit

Wikiquote(0 entries)

edit

Wikisource(0 entries)

edit

Wikiversity(0 entries)

edit

Wikivoyage(0 entries)

edit

Wiktionary(0 entries)

edit

Multilingual sites(0 entries)

edit

Retrieved from "https://www.wikidata.org/w/index.php?title=Q13634063&oldid=1960885784"