Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with sets
Search options not deleted
user 37373
Questions about finite and infinite sets and multisets, related data structures and concepts.
2
votes
1
answer
35
views
How to find number of combinations of choosing one from k subsets
Consider we have set S:
S = {1,2,3,4,5,6}
and 3 (say k) subsets of S:
S_1 = {1,2,3}
S_2 = {2,3,4,5}
S_3 = {1,3,6}
What is the total number of cases choosing one element from each subsets?
Same …
- 123