Timeline for Lower bound for a combinatorial problem ($N$ students taking $n$ exams)
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2019 at 17:23 | vote | accept | Morteza | ||
| Apr 12, 2019 at 19:22 | comment | added | Morteza | The idea was very nice to me. | |
| Apr 12, 2019 at 13:31 | comment | added | Will Brian | Yes, this is basically the same idea. I like the more general way you've expressed it, though, and of course it's nice that you've gotten a better constant for your $n \log n$ term. +1 | |
| Apr 12, 2019 at 10:45 | vote | accept | Morteza | ||
| Apr 12, 2019 at 10:45 | |||||
| Apr 12, 2019 at 9:13 | comment | added | Ilya Bogdanov | Perhaps, now this is almost the same as @WillBrian's construction... | |
| Apr 12, 2019 at 9:11 | history | edited | Ilya Bogdanov | CC BY-SA 4.0 |
The initial argument was wrong; everything is rewritten.
|
| Apr 12, 2019 at 1:39 | history | answered | Ilya Bogdanov | CC BY-SA 4.0 |