Timeline for Weak versions of Bertrand's postulate
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jan 26, 2014 at 17:24 | history | suggested | José Hdz. Stgo. | CC BY-SA 3.0 |
improved formatting
|
| Jan 26, 2014 at 17:22 | review | Suggested edits | |||
| S Jan 26, 2014 at 17:24 | |||||
| Jan 25, 2014 at 16:02 | comment | added | GH from MO | Yes. This is why I think there is no really good answer to the original question. Erdős developed Chebyshev's idea further, and it is hard to do better than him! | |
| Jan 25, 2014 at 15:28 | comment | added | Philip Gibbs | Erdős's proof is another example of the same idea isn't it? But it is tighter and gets down to n=2 | |
| Jan 25, 2014 at 15:00 | comment | added | GH from MO | I think Erdős's proof of Bertrand's postulate (in the pdf file that you linked) is shorter and simpler. | |
| Jan 25, 2014 at 14:41 | vote | accept | Lukas | ||
| Jan 25, 2014 at 13:29 | history | answered | Philip Gibbs | CC BY-SA 3.0 |