Timeline for Polynomial representing prime numbers
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 27, 2009 at 0:45 | comment | added | Ilya Nikokoshev | Thanks, wonderful references! @Bjorn, references in comments don't need any tag: mathdl.maa.org/images/upload_library/22/Ford/… | |
| Dec 27, 2009 at 0:41 | vote | accept | Ilya Nikokoshev | ||
| Dec 27, 2009 at 0:39 | comment | added | Gjergji Zaimi | I believe mathworld.wolfram.com/Prime-GeneratingPolynomial.html has references. | |
| Dec 27, 2009 at 0:38 | comment | added | Bjorn Poonen | <a href="mathdl.maa.org/images/upload_library/22/Ford/…> is a reference. It is a consequence of the work of Davis, Putnam, Robinson, and Matiyasevich on Hilbert's 10th problem that the statement about positive integer outputs holds not only for the set of prime numbers, but also for any set of positive integers that can be the output of a computer program. | |
| Dec 27, 2009 at 0:37 | history | edited | Qiaochu Yuan | CC BY-SA 2.5 |
added 69 characters in body
|
| Dec 27, 2009 at 0:30 | history | answered | Qiaochu Yuan | CC BY-SA 2.5 |