Bertrand’s Postulate
Wednesday, August 19, 2009 8:43Posted in category Notes, Number Theory
No Comments
The fact that, for every positive integer n, there is a prime between n and 2n is known as Bertrand’s postulate (which is a bit odd, as it’s a theorem, but anyhow …) It arises occasionally in Olympiad style problems (usually with the note “You may assume Bertrand’s Postulate that …”) Michael Nielsen has a nice post giving an elementary proof at the Polymath wiki.
You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.
