Timeline for Heuristic justification for Goldbach's conjecture
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 13, 2010 at 12:44 | comment | added | Charles | @T: Absolutely. Mine is a very rough heuristic, based only on a very simple form of the PNT. | |
| Jul 13, 2010 at 1:39 | vote | accept | AgCl | ||
| Jul 12, 2010 at 21:48 | comment | added | T.. | ...and the Rosser and Schoenfeld estimates may be useful for such analyses. | |
| Jul 12, 2010 at 21:47 | comment | added | T.. | Charles, the $n/log(n)$ could have been any asymptotically nearby density function, and using a different choice can raise the expected number of counterexamples. To get meaningful numbers out of this argument requires some analysis of the sensitivity to particular models of the prime distribution. | |
| Jul 12, 2010 at 18:04 | history | answered | Charles | CC BY-SA 2.5 |