Timeline for Combinatorial selection with constraints
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 21, 2021 at 1:23 | vote | accept | A little mouse on the pampas | ||
| Feb 21, 2021 at 1:35 | |||||
| Feb 20, 2021 at 15:57 | comment | added | Simon Woods |
Or more compactly, by ordering the input list to put all singers first: Count[Subsets[{s, s, s, s, s, sd, sd, sd, d, d}, {4}], Except /@ {d, d, s, s}]
|
|
| Feb 20, 2021 at 15:44 | comment | added | Simon Woods |
If you want only the unique ensembles, it's probably more efficient to create the length 4 subsets directly: Count[Subsets[{s, s, s, s, s, d, d, sd, sd, sd}, {4}], {OrderlessPatternSequence[s | sd, s | sd, d | sd, d | sd]}]
|
|
| Feb 20, 2021 at 11:19 | history | edited | JimB | CC BY-SA 4.0 |
Modified “correct” to “alternative”
|
| Feb 20, 2021 at 4:48 | history | answered | JimB | CC BY-SA 4.0 |