Bertrand's postulate: Revision history

18 August 2009

• curprev 05:5905:59, 18 August 2009‎ WikiSysop talk contribs‎ 10,225 bytes +1,484‎ Added final part of proof, corrected many small errors

14 August 2009

• curprev 07:0107:01, 14 August 2009‎ WikiSysop talk contribs‎ 8,741 bytes −1‎ No edit summary
• curprev 06:0506:05, 14 August 2009‎ WikiSysop talk contribs‎ 8,742 bytes +2,237‎ Improved overview, more details of proof added

11 August 2009

• curprev 16:1816:18, 11 August 2009‎ WikiSysop talk contribs‎ 6,505 bytes −1‎ No edit summary
• curprev 16:0816:08, 11 August 2009‎ WikiSysop talk contribs‎ m 6,506 bytes +3‎ No edit summary
• curprev 16:0716:07, 11 August 2009‎ WikiSysop talk contribs‎ 6,503 bytes +2,809‎ Added lemma showing that prime powers are not large in combinatorial coefficients
• curprev 16:0416:04, 11 August 2009‎ WikiSysop talk contribs‎ 3,694 bytes +1,326‎ Added proof of Chebyshev bound
• curprev 16:0216:02, 11 August 2009‎ WikiSysop talk contribs‎ 2,368 bytes +1,309‎ Added a brief discussion of the Chebyshev bound
• curprev 15:5715:57, 11 August 2009‎ WikiSysop talk contribs‎ 1,059 bytes +492‎ Added segue to proof, and statement of Chebyshev bound

6 August 2009

• curprev 09:3509:35, 6 August 2009‎ Teorth talk contribs‎ 567 bytes +567‎ New page: Bertrand's postulate asserts that for every positive integer N, there is a prime between N and 2N. Despite its name, it is actually a theorem rather than a postulate. For large N, the ...