Timeline for Multiplicity one prime in the factorisation of p-N
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 21, 2011 at 3:32 | comment | added | Hugo Chapdelaine | Thanks a lot Gjergji, I might need some effective constant at some point. | |
| Mar 21, 2011 at 3:31 | vote | accept | Hugo Chapdelaine | ||
| Mar 21, 2011 at 0:40 | comment | added | Charles | @Gjergji Zaimi: Sorry, didn't see your comment until I added mine. Yes, same idea. | |
| Mar 21, 2011 at 0:39 | comment | added | Charles | In particular, combining Golomb 1970 with Rosser 1941 allows an explicit (and small) bound on allowable N. | |
| Mar 21, 2011 at 0:36 | comment | added | Gjergji Zaimi | Also note that the asymptotic results needed come with effective constants so this will hold for all $N>c$ for some $c$ we can compute. | |
| Mar 21, 2011 at 0:21 | history | answered | Gjergji Zaimi | CC BY-SA 2.5 |