Timeline for find a set of integers where {$a_i + a_j | 1 \le i \le j \le n$} leave distinct remainders when divided by $n(n+1)/2$
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 19, 2018 at 22:21 | history | edited | Gerhard Paseman | CC BY-SA 4.0 |
added 759 characters in body
|
| Jun 19, 2018 at 20:18 | history | edited | Gerhard Paseman | CC BY-SA 4.0 |
added 31 characters in body
|
| Jun 19, 2018 at 20:17 | comment | added | Gerhard Paseman | Thanks for checking. I am now getting that too. Gerhard "Back To The Starbucks Napkin" Paseman, 2018.06.19. | |
| Jun 19, 2018 at 20:13 | history | edited | Gerhard Paseman | CC BY-SA 4.0 |
added 31 characters in body
|
| Jun 19, 2018 at 20:09 | comment | added | David E Speyer | One of us is getting the $n=5$, $p=3$ computation wrong. The multiset $\{ 0,0,1,1,2 \}$ achieves each sum modulo $3$ in $5$ ways. | |
| Jun 19, 2018 at 20:06 | history | answered | Gerhard Paseman | CC BY-SA 4.0 |