Timeline for Prime Number Theorem w/o Complex Analysis
Current License: CC BY-SA 2.5
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 8, 2011 at 17:36 | answer | added | Richard Dore | timeline score: 6 | |
| Apr 6, 2011 at 18:51 | answer | added | Emerton | timeline score: 7 | |
| Apr 6, 2011 at 17:38 | answer | added | M Mueger | timeline score: 5 | |
| Apr 5, 2011 at 5:26 | vote | accept | LowerBounds | ||
| Apr 5, 2011 at 0:06 | answer | added | Gerry Myerson | timeline score: 8 | |
| Apr 4, 2011 at 21:18 | comment | added | GH from MO | It is worthwhile to note that the Erdős-Selberg proof is nicely explained in Hardy-Wright: An introduction to the theory of numbers. See sections 22.14-22.16 there, especially Theorems 430 and 434. | |
| Apr 4, 2011 at 21:17 | comment | added | j.c. | Indeed, Erdos and Selberg are cited in the second sentence of Newman's paper... jstor.org/stable/2321853 | |
| Apr 4, 2011 at 21:12 | answer | added | Charles Matthews | timeline score: 6 | |
| Apr 4, 2011 at 20:55 | comment | added | Gerhard Paseman | Yes. Do a net search. Erdos and Selberg (if memory serves) each did a mostly non-analytic version. Gerhard "Ask Me About System Design" Paseman, 2011.04.04 | |
| Apr 4, 2011 at 20:54 | comment | added | Jon Bannon | Check this out: jstor.org/pss/1969455 Erdos and Selberg have an elementary proof. | |
| Apr 4, 2011 at 20:50 | history | asked | LowerBounds | CC BY-SA 2.5 |