Timeline for Covering the primes with pairs of consecutive integers
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 14, 2019 at 14:32 | vote | accept | Bernardo Recamán Santos | ||
| Apr 10, 2019 at 5:55 | answer | added | Aaron Meyerowitz | timeline score: 2 | |
| Apr 9, 2019 at 21:54 | answer | added | Alexander Kalmynin | timeline score: 9 | |
| Apr 9, 2019 at 16:49 | answer | added | Gerhard Paseman | timeline score: 3 | |
| Apr 9, 2019 at 15:49 | comment | added | Gerhard Paseman | I suspect not, and that the largest n for whicb this can be done is less than 100. Most of the integers will be determined by the primes above n/3, and you will not have allotted enough of them. Gerhard "Consider The Powers Of Threes" Paseman, 2019.04.09. | |
| S Apr 9, 2019 at 15:41 | history | suggested | Freddy Barrera | CC BY-SA 4.0 |
Edited with the proposer's consent.
|
| Apr 9, 2019 at 15:18 | review | Suggested edits | |||
| S Apr 9, 2019 at 15:41 | |||||
| Apr 9, 2019 at 12:53 | history | edited | Bernardo Recamán Santos | CC BY-SA 4.0 |
Clarificatiom
|
| Apr 9, 2019 at 12:45 | answer | added | A. Bailleul | timeline score: 2 | |
| Apr 9, 2019 at 12:31 | history | asked | Bernardo Recamán Santos | CC BY-SA 4.0 |