Timeline for Covering $\mathbb{N}$ with prime arithmetic progressions
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 12, 2011 at 7:40 | comment | added | Gerhard Paseman | Another cover is to assign the k_i using an enumeration of whatever integers are to be covered. The challenge is to meet the desired inequalities. Gerhard "Ask Me About System Design" Paseman, 2011.11.11 | |
| Nov 12, 2011 at 7:01 | history | answered | Dimitris Koukoulopoulos | CC BY-SA 3.0 |