Timeline for A prime sequence can be partitioned into two sets of equal or consecutive sum
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 15, 2010 at 12:00 | comment | added | user8140 | I think that we could just do the greedy algorithm on choosing `$e_n, then e_n−1, and so on, until to e_6, then choose e_6,...,e_1 by hand.$' | |
| Aug 15, 2010 at 11:52 | vote | accept | user8140 | ||
| Aug 15, 2010 at 11:47 | comment | added | user8140 | please read Mariano Suárez-Alvarez's comment! when M(n−1)=0, then it must be M(n)=2 – a-boy 0 secs ago | |
| Aug 15, 2010 at 11:30 | vote | accept | user8140 | ||
| Aug 15, 2010 at 11:50 | |||||
| Aug 13, 2010 at 9:22 | history | answered | dvitek | CC BY-SA 2.5 |