Timeline for Creating a combinations with unique sets
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 29, 2013 at 13:15 | answer | added | Joshua Erde | timeline score: 0 | |
| Jun 2, 2010 at 17:43 | vote | accept | khuss | ||
| Jun 1, 2010 at 0:21 | answer | added | Gerry Myerson | timeline score: 1 | |
| May 31, 2010 at 16:41 | comment | added | Charles Matthews | Try formulating in terms of the Hamming distance, as used in coding theory. en.wikipedia.org/wiki/Hamming_distance . Writing strings of 0s and 1s (with just three 1s) differing in all but two places, is probably clearer. You presumably want an example of such a "code". | |
| May 31, 2010 at 16:35 | comment | added | Robin Chapman | It's not entirely clear to me what you are after, but I suspect you are groping towards the idea of a block design: en.wikipedia.org/wiki/Block_design . | |
| May 31, 2010 at 16:30 | history | asked | khuss | CC BY-SA 2.5 |