Timeline for Does every prime $p$ appear in a $p$-term arithmetic progression of primes?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 12, 2018 at 13:49 | comment | added | Sylvain JULIEN | In other words, $ C(p) $ is a primality radius of $ p+C(p), p+2C(p),\cdots p+(p-2)C(p) $. Note also that the proportion of primality radii of $ n $ is greater than $ \frac{a}{\log^{2} n }$ for some absolute $ a>0 $. So that if should suffice to require $ (\frac{a}{\log^{2}(p+pC(p))})^{p-2}>\frac{1}{p+pC(p)} $. | |
| Aug 12, 2018 at 13:26 | comment | added | Sylvain JULIEN | The sequence $ C(p), 2C(p),\cdots \frac{p-1}{2}C(p) $ forms an arithmetic sequence of primality radii of $ p+\frac{p-1}{2}C(p) $. This may help to bound $ k $ in terms of $ p $. | |
| Aug 12, 2018 at 13:12 | comment | added | Will Sawin | Probably because the method doesn't work (you ensure indivisibility by small primes, but the numbers could still have a large prime factor. There is no suitable choice of k.) | |
| Aug 12, 2018 at 10:45 | comment | added | Sylvain JULIEN | Why the downvote ? | |
| Aug 12, 2018 at 9:38 | history | answered | Sylvain JULIEN | CC BY-SA 4.0 |