Real-World Combinations Calculator

Combinations (nCr) calculate the number of ways to choose a subset of items from a larger set where order does not matter. This distinguishes them from permutations (where order matters). Combinations appear in probability, lottery odds, team selection, and menu planning.

Combination formula: C(n, r) = n! ÷ (r! × (n − r)!)

Also written as nCr or “n choose r”

Where:

• n: total number of items in the set
• r: number of items to choose
• !: factorial (n! = n × (n−1) × (n−2) × … × 1)
• Order does not matter: C(n,r) = C(n, n−r)

Key identity: C(n,r) = C(n, n−r) — choosing 3 from 10 gives the same count as choosing 7 from 10 (you’re choosing the same groupings from either direction).

Combinations vs. permutations:

• Permutations P(n,r) = n! ÷ (n−r)!: order matters (e.g. ranked positions)
• Combinations C(n,r) = P(n,r) ÷ r!: order ignored (e.g. team roster)

Real-world applications:

Lottery odds: Powerball: choose 5 from 69 white balls + 1 from 26 red balls. C(69,5) × C(26,1) = 11,238,513 × 26 = 292,201,338 — about 1 in 292 million

Card hands in poker: C(52,5) = 52! ÷ (5! × 47!) = 2,598,960 possible 5-card hands

Committee selection: From 20 employees, choose a committee of 4: C(20,4) = 20! ÷ (4! × 16!) = 4,845 possible committees

Sports brackets (choose teams): From 8 teams, choose 3 for a round-robin: C(8,3) = 56 matchup sets

Pizza topping combinations: 10 available toppings, choose any 3: C(10,3) = 10! ÷ (3! × 7!) = 120 different 3-topping pizzas

Worked example: Your company has 12 employees. You must select a team of 4 for a project. How many unique teams are possible?

C(12, 4) = 12! ÷ (4! × 8!) = (12 × 11 × 10 × 9) ÷ (4 × 3 × 2 × 1) = 11,880 ÷ 24 = 495 possible teams

If you additionally need to assign one of those 4 as team lead (making order matter for that one slot): 495 × 4 = 1,980 unique team+leader combinations (combining C with P for the leadership slot).