Count distinct items
Start with n different
items.
Count unordered groups from
distinct items, without repeats.
C(8, 3)
One group shown; 56 possible groups.
Start with n different
items.
Pick a group size r,
with 0 ≤ r ≤ n.
The number of unordered
groups is C(n, r).
C(8, 3) = (8 ×7 ×6) / (3 ×2 ×1) = 56
There is one empty selection, so C(n,0)=1, including C(0,0)=1.
Combinations ignore order. The same three items in a different order still form one group. Permutations count different arrangements.
No. The calculation uses exact integers for0 ≤ r ≤ n ≤ 1000. Copy or download the complete result.
No. It is one labeled example, not a complete enumeration. Large pools show only their first eight items schematically.