Timeline for 3x3 "Magic Square" of Prime Numbers
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 17, 2017 at 0:57 | answer | added | user42374 | timeline score: 1 | |
| Mar 24, 2015 at 7:47 | history | edited | LaBird | CC BY-SA 3.0 |
Added updated part and removed the "open-ended" tag because the optimal answer was found.
|
| Mar 24, 2015 at 7:38 | vote | accept | LaBird | ||
| Mar 24, 2015 at 6:48 | answer | added | Jose Lopez Garcia | timeline score: 4 | |
| Mar 23, 2015 at 14:16 | answer | added | Christopher | timeline score: 2 | |
| Mar 23, 2015 at 14:15 | answer | added | schnaader | timeline score: 18 | |
| Mar 23, 2015 at 13:22 | answer | added | Novarg | timeline score: 2 | |
| Mar 23, 2015 at 11:47 | history | edited | Rand al'Thor | CC BY-SA 3.0 |
edited body
|
| Mar 23, 2015 at 11:42 | answer | added | Rand al'Thor | timeline score: 5 | |
| Mar 23, 2015 at 11:33 | comment | added | LaBird | @randal'thor Thanks. Mathematically speaking, I tried a greedy strategy. Seems to work nicely until the bottom right hand corner, I need to use $59$, and it is not at the best position either (it is involved in $3$ of the $8$ sums). So that's why I think it is possible to beat the $480$ total. | |
| Mar 23, 2015 at 11:27 | comment | added | Rand al'Thor | Your solution is pretty good, using six of the seven smallest odd primes. It may well not be beatable. Great puzzle though. | |
| Mar 23, 2015 at 11:27 | history | edited | Rand al'Thor |
edited tags
|
|
| Mar 23, 2015 at 11:25 | review | First posts | |||
| Mar 23, 2015 at 11:32 | |||||
| Mar 23, 2015 at 11:22 | history | asked | LaBird | CC BY-SA 3.0 |