Representing these subsets (in the same order) as base 2 numerals:

*0 - 000
*1 - 001
*2 - 010
*3 - 011
*4 - 100
*5 - 101
*6 - 110
*7 - 111

Probability: sampling a random combination

There are various algorithms to pick out a random combination from a given set or list. Rejection sampling is extremely slow for large sample sizes. One way to select a k-combination efficiently from a population of size n

1.Previous
3.Next