Combination Definition

Combinatorics · Axiom Academy

Understanding combinations as unordered selections Definition: A combination is an unordered selection of r objects from a set of n distinct objects. The key distinction from permutations is simple but crucial: order doesn't matter in combinations. For example, if we're selecting 2 letters from A, B, C : In permutations : AB and BA are different In combinations : AB and BA are the same We use several notations to represent "the number of ways to choose r objects from n objects": The most common mathematical notation is the binomial coefficient : All of these notations mean the exact same thing and can be used interchangeably. 3. Deriving the Combination Formula How do we count combinations? Let's think about the relationship between permutations and combinations. Key insight: Every combination of r objects can be arranged in r! different ways. Since permutations count all arrangements and combinations don't care about order, we need to divide out the redundant arrangements: Substituting the permutation formula P(n,r) = n!/(n-r)!: Let's see a concrete example: choosing 2 letters from A, B, C . Using permutations , we get P(3,2) = 6 arrangements: Using combinations , we group arrangements that use the same letters: Each combination appears 2! = 2 times in the permutation list. So we divide: C(3,2) = P(3,2)/2! = 6/2 = 3 5. The "Choose" Interpretation

This is the written version of the interactive lesson above. See the full Combinatorics course.