Selecting a Committee

Discrete Math · Axiom Academy

Understanding when order matters: Permutations vs. Combinations Excellent work! You now understand the fundamental difference between permutations and combinations: Permutations (Order Matters): Use P(n,r) when the arrangement or position matters. Examples: selecting officers with specific titles, race rankings, password sequences. Combinations (Order Doesn't Matter): Use C(n,r) when you're just choosing a group and positions are irrelevant. Examples: committees, teams, lottery numbers, pizza toppings. The Relationship: C(n,r) = P(n,r) ÷ r! because combinations eliminate the r! duplicate orderings that permutations count. Ask Yourself: "If I swap two selections, is it different?" If yes → permutation. If no → combination. This principle applies throughout discrete mathematics, probability, and combinatorics. Master this distinction, and counting problems become much clearer!

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