Timeline for Multiplicity one prime in the factorisation of p-N
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 21, 2011 at 3:31 | vote | accept | Hugo Chapdelaine | ||
| Mar 21, 2011 at 1:33 | answer | added | Dimitris Koukoulopoulos | timeline score: 1 | |
| Mar 21, 2011 at 0:21 | answer | added | Gjergji Zaimi | timeline score: 6 | |
| Mar 21, 2011 at 0:07 | history | edited | Gjergji Zaimi | CC BY-SA 2.5 |
deleted 1 characters in body; edited tags
|
| Mar 20, 2011 at 23:31 | comment | added | Gerry Myerson | Following on Charles' comment, let $q$ be the smallest odd prime not dividing $N$, then there should be lots of primes $p$, $N\lt p\le 3N/2$, $N\equiv p\pmod q$, $N\not\equiv p\pmod{q^2}$. Time to rummage through the literature on primes in arithmetic progressions. | |
| Mar 20, 2011 at 22:57 | comment | added | Charles Matthews | You're asking for primes p in arithmetic progressions (say with modulus the square of q)? This is much easier than approximations to Goldbach, unless the intervals are very short. | |
| Mar 20, 2011 at 22:23 | history | asked | Hugo Chapdelaine | CC BY-SA 2.5 |