Timeline for 17 camels trick
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2020 at 6:43 | comment | added | Mike Earnest | Do you know whether or not $|T|\le n+1$ is tight for the second problem? When $n$ is odd, you can further prove $|T|\le n$, and this is tight (let $T$ be the set of complements of singletons). When $n$ is even, though, I cannot even find a valid $T$ with size $n$. | |
| Jul 19, 2020 at 13:06 | comment | added | Aditya Guha Roy | Aha ! This is classic. | |
| Jul 4, 2017 at 22:07 | review | First posts | |||
| Jul 4, 2017 at 22:08 | |||||
| Jun 17, 2017 at 22:46 | history | edited | Scott Mutchnik | CC BY-SA 3.0 |
added 1 character in body
|
| S Jun 17, 2017 at 4:32 | history | answered | Scott Mutchnik | CC BY-SA 3.0 | |
| S Jun 17, 2017 at 4:32 | history | made wiki | Post Made Community Wiki by Scott Mutchnik |