Timeline for Are there any interesting or lesser known proofs related to Bertrand's Postulate
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 5, 2018 at 16:44 | comment | added | Đào Thanh Oai | Today, I am thinking about Goldbach conjecture and Bertrand's Postulate. I think can using Goldbach conjecture to prove Bertrand's Postulate. But I was born later. | |
| Sep 30, 2015 at 2:16 | history | protected | S. Carnahan♦ | ||
| Sep 29, 2015 at 20:31 | answer | added | wiskundeliefhebber | timeline score: 1 | |
| May 3, 2013 at 11:46 | answer | added | Armin | timeline score: -2 | |
| Sep 6, 2012 at 1:05 | answer | added | Larry Freeman | timeline score: 0 | |
| Aug 7, 2012 at 21:34 | answer | added | Aaron Meyerowitz | timeline score: 4 | |
| Aug 7, 2012 at 6:46 | answer | added | user22202 | timeline score: 2 | |
| Aug 2, 2012 at 7:04 | vote | accept | Larry Freeman | ||
| Aug 2, 2012 at 0:38 | answer | added | Igor Rivin | timeline score: 3 | |
| Aug 2, 2012 at 0:35 | answer | added | Benjamin Dickman | timeline score: 19 | |
| Aug 2, 2012 at 0:34 | comment | added | Igor Rivin | The proof for $2n/3n$ is in this paper by el Bacharaoui: m-hikari.com/ijcms-password/ijcms-password13-16-2006/… It is an extension of Erdos' proof. | |
| Aug 1, 2012 at 23:24 | comment | added | Qiaochu Yuan | Find a version of the prime number theorem that gives explicit lower and upper bounds... | |
| Aug 1, 2012 at 23:15 | comment | added | Gerhard Paseman | I don't know about different, but Joe Roberts has a text you might like which has Finsler's refinement that gives estimates on pi(2n) -pi(n). It is a calligraphed number theory text. Gerhard "Ask Me About System Design" Paseman, 2012.08.01 | |
| Aug 1, 2012 at 22:54 | history | asked | Larry Freeman | CC BY-SA 3.0 |