Combinatorics – Committee Selection & Pascal’s Triangle Shortcuts

Committee-Selection Example (Men & Women)

• Scenario setup

  • Selecting a committee consisting of 3 men and 2 women.

  • Total undisclosed pool of men & women, but the focus of the excerpt is on the men’s subgroup first.

  • Restriction: Two particular men refuse to serve together.

• Step-by-step counting logic

  1. Initial count (prior to restriction)

  • Instructor references $35$ possible ways to choose any 3 men (implied: $\binom{?}{3}=35$).

  • For the women, there are $10$ possible ways to choose the required 2 women (implied: $\binom{?}{2}=10$).

  • Raw total (before restrictions): $35 \times 10 = 350$ possible committees.

  1. Excluding the forbidden pair of men

  • First compute how many 3-man groups include both of the incompatible men.
    • Treat the conflicting pair as already chosen (2 spots filled).
    • Need 1 additional man from the remaining pool.
    • Instructor states there are $5$ ways to do that.

  • These 5 invalid 3-man groups must be removed from the original 35 → remaining valid 3-man groups: $35-5=30$.

  1. Forming full committees after filtering

  • Combine the 30 acceptable male triples with the 10 female pairs:
    $30 \times 10 = 300$

  • Final answer: 300 allowable committees (down from the naïve 350 once the restriction is applied).

  1. Interpretation / significance

  • Demonstrates the subtraction (or complement) principle in combinatorics: count everything, subtract the unwanted cases.

  • Highlights that constraints on one subgroup (men) can be processed first, then multiplied by the independent count of another subgroup (women).

Pascal’s Triangle Refresher

• Construction rules

  • Each row starts and ends with 1.

  • Every interior entry equals the sum of the two entries directly above it.

  • Row indexing convention used in class:
    • Top “1” is Row 0.
    • Next row "1 1" is Row 1, etc.

• Why it matters

  • Pascal’s Triangle provides quick look-up values for combinations $\binom{n}{r}$ without evaluating factorials.

  • Connection to the binomial theorem and numerous number-pattern properties (triangular numbers, Fibonacci diagonals, etc.).

• Quick look-up procedure demo’d

  1. Example: $6 \choose 4$

  • Go to Row 6 (remember, start counting at 0).

  • Within that row, counting starts at position 0.

  • The 4th term in Row 6 is 15 → $\binom{6}{4}=15$.

  1. Impromptu class drill: the instructor asks “7 2 3?”

  • Students reply 35; context implies $\binom{7}{3}=35$.

Combination vs. Permutation Formulae (implicit reminders)

• Combination (order doesn’t matter):
  $\binom{n}{r}=\frac{n!}{r!(n-r)!}$

• Permutation (order does matter):
  $P(n,r)=\frac{n!}{(n-r)!}$

• Pascal’s Triangle only encodes combination numbers, not permutations.

Practical Tips & Patterns Highlighted

• When given a restriction (e.g.
  incompatible members, mandatory pairings), it’s usually faster to count all possibilities first and then subtract the impossible ones.

• In committee / team problems:

  • Separate independent sub-selections (e.g.
    men vs. women) so you can multiply counts at the end.

  • If a restriction involves only one subgroup, handle it before multiplying.

• Pascal’s Triangle shortcuts are especially handy when the factorial formula feels heavy or when numbers are small (rows ≤10–12 are easy to memorize or jot down).

Ethical & Practical Relevance (briefly echoed in lecture)

• Real-world situations often impose restrictions (people who cannot work together, skill-set requirements).

• Understanding how to incorporate constraints ensures counts/decisions are realistic, not merely theoretical.

Instructor’s Closing & Homework Cue

• Students were shown four homework problems (photograph advised).

• Reminder: use Pascal’s Triangle for combinations only; permutations demand the factorial formula or a different tool.