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
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 20, 2018 at 5:51 | answer | added | Seva | timeline score: 3 | |
| Jun 19, 2018 at 20:23 | answer | added | Lucia | timeline score: 8 | |
| Jun 19, 2018 at 20:22 | answer | added | Will Sawin | timeline score: 10 | |
| Jun 19, 2018 at 20:06 | answer | added | Gerhard Paseman | timeline score: 1 | |
| Jun 19, 2018 at 18:47 | comment | added | David E Speyer | Besides $n=2$, do you know any cases where this is doable? | |
| Jun 19, 2018 at 18:40 | answer | added | David E Speyer | timeline score: 3 | |
| Jun 19, 2018 at 18:22 | history | edited | Alex M. | CC BY-SA 4.0 |
added 121 characters in body; edited tags
|
| Jun 19, 2018 at 17:55 | review | First posts | |||
| Jun 19, 2018 at 18:22 | |||||
| Jun 19, 2018 at 17:53 | history | asked | space | CC BY-SA 4.0 |