Rare card
Bertrand's postulate
- Value
- 50 W
- Attack
- 242
- Defence
- 194
- Players
- 0
In number theory, Bertrand's postulate is the theorem that for any integer n > 3 {\displaystyle n>3} , there exists at least one prime number p {\displaystyle p} with n < p < 2 n − 2.
Get Bertrand's postulate in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack