Timeline for On Euclid's proof of the infinitude of primes and generating primes
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 23, 2020 at 5:39 | comment | added | Denis Serre | See my question Constructing prime numbers, mathoverflow.net/q/38794. | |
| Sep 13, 2010 at 5:05 | history | edited | Charles |
edited tags
|
|
| Nov 24, 2009 at 14:35 | answer | added | Gabriel Benamy | timeline score: 7 | |
| Nov 11, 2009 at 4:03 | answer | added | Pete L. Clark | timeline score: 8 | |
| Nov 11, 2009 at 1:24 | vote | accept | paarshad | ||
| Nov 10, 2009 at 21:38 | comment | added | Jason Dyer | I should add this is the Sylvester sequence, and at the Polymath Project I made the conjecture that any primorial number p_n (where n is the product of the first n primes) works as an initial term so the sequence only generates primes. polymathprojects.org/2009/08/09/… | |
| Nov 10, 2009 at 21:23 | answer | added | Qiaochu Yuan | timeline score: 22 | |
| Nov 10, 2009 at 20:48 | comment | added | paarshad | So obviously they can cause different sequences. I am interested in know why adding multiplicity would make the sequence more manageable. The first time I saw a change was for [11] without multiplicity [11] (x5)-> [11,2,3,67,4423,43,454849,7,37,2029,727929913] with multiplicty [11] (x5)-> [11,2,2,3,7,19,97,181,103,139,21529,13,7308166138386889] | |
| Nov 10, 2009 at 20:34 | comment | added | Qiaochu Yuan | If you run into a number with prime factors of some multiplicity, do you add them to your list with that multiplicity or just once? (I think the problem will be easier if you add them in with multiplicity.) | |
| Nov 10, 2009 at 20:27 | history | asked | paarshad | CC BY-SA 2.5 |