Combinations: Choosing 5 Basketball Starters from 12 Players

What This Problem Teaches

• Distinguishing between combinations and permutations based on whether order matters
• Setting up and calculating combination formulas C(n,k) efficiently
• Simplifying factorial expressions by canceling common terms before computing
• Recognizing selection problems in real-world contexts like sports lineups
• Understanding why certain counting principles apply to team formation scenarios

Visualizing the Problem

This diagram shows the key insight: we're selecting 5 players from a pool of 12, and the order of selection doesn't matter. All five starters have the same role, so this is a combinations problem.

Solution: Method 1 — The Combination Formula

Since the order in which players are chosen doesn't matter (being a starter is the same role for all 5), this is a combination problem, not a permutation.

Step 1 — Set up the combination formula

We need to find C(12,5), which represents choosing 5 players from 12 total players.

Step 2 — Simplify before calculating

Rather than computing huge factorials, we can cancel the 7! terms immediately:

Step 3 — Calculate the numerator

Let's compute the top step by step:

Step 4 — Calculate the denominator

Now for the bottom:

Step 5 — Divide to get the final answer

Solution: Method 2 — The Complement Approach

We can use the symmetry property of combinations: C(n,k) = C(n,n-k). Choosing 5 starters is equivalent to choosing 7 players to sit on the bench.

Step 1 — Apply the symmetry property

Step 2 — Determine which calculation is easier

Since 5 < 7, calculating C(12,5) directly requires fewer multiplications than C(12,7). The complement doesn't help here, but this principle is valuable when k > n/2.

Step 3 — Verify using the original method

As expected, both approaches give the same result: 792 possible starting lineups.

Verification

Let's verify our calculation by checking the arithmetic:

We can also check this makes sense: choosing 5 from 12 should give more options than choosing 5 from 10 [C(10,5) = 252] but fewer than choosing 6 from 12 [C(12,6) = 924]. Our answer of 792 falls correctly between these bounds.

Watch Out For These

The Pattern Behind This

This problem follows the general combination formula for selecting k items from n total items:

Key insights about combinations:

• C(n,k) = C(n,n-k) — choosing k items equals choosing which (n-k) items to exclude
• C(n,0) = C(n,n) = 1 — there's exactly one way to choose everything or nothing
• C(n,1) = C(n,n-1) = n — choosing one item equals the number of items available
• The calculation is most efficient when you use the smaller of k and (n-k)

Real Applications

Sports team management: Coaches regularly make lineup decisions similar to this problem — selecting starters, choosing special teams units, or picking players for tournaments.

Committee formation: Organizations use combinations to determine how many ways they can select committee members from a larger group, ensuring fair representation without regard to selection order.

Product testing: Companies calculate combinations when choosing which subset of features to test simultaneously, or which sample groups to study from a larger population.

Four "What-If?" Problems