Timeline for enumerative combinatorics with fixed number repeats
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 23, 2010 at 4:30 | comment | added | Yuval Filmus | I think so, you can punch in some numbers and check. | |
| Jul 20, 2010 at 3:05 | comment | added | harschware | I'm trying to absorb this and it seemed I may not have stated that repeats don't have to be contiguous in the problem, does your solution still hold? | |
| Jul 20, 2010 at 1:28 | history | answered | Yuval Filmus | CC BY-SA 2.5 |