Course contentsShow
← Mathematics
Lesson 2588 of 3,12152. CombinatoricsFree lesson

Introduction to Combinations

Define combinations as selections where order doesn't matter, and distinguish them from permutations.

Introduction to Combinations

What You'll Learn

You'll discover how to count selections where the order of chosen items doesn't matter—a fundamental concept that differs crucially from permutations.

The Core Idea

Imagine you're selecting a 3-person committee from 5 volunteers: Alice, Bob, Carol, Dan, and Eve. Is the committee {Alice, Bob, Carol} different from {Bob, Alice, Carol}? No—they're the same three people, just listed differently.

This is a combination: a selection of objects where order doesn't matter.

Combinations vs. Permutations

You've already learned about permutations, where order does matter. If you arrange Alice, Bob, and Carol in a line for a photo, ABC is different from BAC—that's a permutation.

But if you're just choosing which three people to invite, ABC and BAC represent the same selection—that's a combination.

The key distinction:

  • Permutation: Arrangement matters (ABC ≠ BAC)
  • Combination: Selection only (ABC = BAC = CAB = ...)

Visualizing the Difference

Consider choosing 2 letters from {A, B, C}:

Permutations (order matters): AB, BA, AC, CA, BC, CB → 6 arrangements

Combinations (order doesn't matter): {A,B}, {A,C}, {B,C} → 3 selections

Notice that each combination corresponds to multiple permutations. Every 2-element combination generates 2! = 2 permutations (the two different orderings).

Common Real-World Examples

  • Selecting pizza toppings (mushrooms + pepperoni = pepperoni + mushrooms)
  • Choosing team members
  • Picking lottery numbers
  • Forming card hands in poker

Key Takeaway: Combinations count selections where order is irrelevant, while permutations count arrangements where order matters. Each combination corresponds to multiple permutations, since the same objects can be arranged in different orders.