Topic 2: Probability — Counting, Permutations & Combinations (Part 1)

Topic 2: Probability

• Topic focus: Probability Part 1 — Counting, Permutations, and Combinations
• Key concepts touched in transcript: Counting principles, basic probability concepts, permutations (arrangements), combinations (selections), with/without replacement, circle arrangements, factorials, and related rules. Also introduces notational conventions and examples to illustrate counting techniques.

Counting: Basic concepts

• Counting basics: When you have multiple experiments or choices, the total number of distinct outcomes is obtained by the multiplication principle.
  • If Experiment A has $m$ possible outcomes and for each outcome of A there are $n$ possible outcomes of Experiment B, then the total number of combined outcomes is $m\times n\,.$
  • Example from transcript (Counting Example):
  • Pen color: RED or BLUE (2 outcomes)
  • Catch outcome: Success or Fail (2 outcomes)
  • Total outcomes = $2 \times 2 = 4$ with outcomes: { {RED, Success}, {BLUE, Success}, {RED, Fail}, {BLUE, Fail} }.
• In short: basic counting uses the multiplication rule to combine independent choice steps.

Counting: With replacement vs without replacement

• With replacement (replacement allowed between draws): The number of sequences of length $r$ from $n$ distinct items is
  • $n^r$
  • Example: 26-letter alphabet (A–Z), choosing 5 positions with replacement yields $26^5 = 11881376.$
• Without replacement (no item can be chosen more than once): the number of ordered sequences (permutations) depends on how many items $n$ you start with and how many you choose $r$.
  • If every item is distinct and order matters: ${}<em>nP</em>r = \frac{n!}{(n-r)!} \,.$
  • If you select all $n$ items (i.e., $r=n$): {}nPn = \frac{n!}{(n-n)!} = n!.

Factorial

• Definition: n! = n \times (n-1) \times (n-2) \times \cdots \times 1.
• Special case: 0! = 1.
• Uses: foundational for permutations, combinations, and many counting formulas.

Permutations: general concepts

• Permutations are arrangements where order matters.
• Distinctions:
  • Permutations (order counts) without replacement (all items distinct): {}nPr = \frac{n!}{(n-r)!}.
  • Permutations with identical items (some items identical): if the $n$ items consist of $n1$ of type1, $n2$ of type2, …, $nk$ of type k (with $n1+\cdots+nk=n$), then the number of distinct permutations is \frac{n!}{n1!\,n2!\cdots nk!} .
• Circle arrangements (permutations around a circle): when arranging $n$ items in a circle, the number of distinct arrangements (up to rotation) is (n-1)! .
  • Reason: fixing one item and arranging the rest linearly.

Permutations: Rule 1 (identical items, all items chosen, order counts)

• Scenario: $n$ items available, all $n$ are selected, but some items are identical.
  • Number of distinct permutations:
    \frac{n!}{n1!\,n2!\cdots n_k!} .
• Example 3 (from transcript): 14 colored balls with counts $4$ Red, $2$ Blue, $3$ Green, $5$ Purple.
  • Sample space: 14 items with multiplicities $(4,2,3,5)$.
  • Number of permutations (all 14 selected, arranged in a row):
    \frac{14!}{4!\,2!\,3!\,5!} .
• Example 4 (REVISIT): arrange 14 colored balls in a circle with the same multiplicities.
  • Number of circular permutations:
    \frac{14!}{4!\,2!\,3!\,5!} \times \frac{1}{14} = \frac{14!}{14\,4!\,2!\,3!\,5!} = \frac{(14-1)!}{4!\,2!\,3!\,5!} = \frac{13!}{4!\,2!\,3!\,5!} .
• Example 5: Letters from the word “LAPTOP” arranged around a circle.
  • LAPTOP has 6 letters with the letter P appearing twice.
  • Circular arrangements with duplicates:
    \frac{(6-1)!}{2!} = \frac{5!}{2!} = 60.
• Example 6: Letters from the word “STATISTICS” arranged around a circle.
  • Letters: S(3), T(3), A(1), I(2), C(1) → total 10 letters.
  • Distinct circular arrangements:
    \frac{(10-1)!}{3!\,3!\,2!\,1!\,1!} = \frac{9!}{3!\,3!\,2!} = 5040.
• Example 7: A bag with 4 red and 3 yellow balls; 5 balls drawn and arranged in a row.
  • Possible distributions (order matters within the row) and counts:
  • 4R, 1Y: number of arrangements = $\displaystyle \frac{5!}{4!1!} = 5$.
  • 3R, 2Y: number of arrangements = $\displaystyle \frac{5!}{3!2!} = 10$.
  • 2R, 3Y: number of arrangements = $\displaystyle \frac{5!}{2!3!} = 10$.
  • Total permutations across these cases: 5 + 10 + 10 = 25.

Permutations: Rule 2 (every item is unique / different from each other)

• Scenario: No. of different permutations when $n$ distinct items are available and only $r$ are selected, order matters:
  {}nPr = \frac{n!}{(n-r)!} .
• If all $n$ items are selected, i.e. $r=n$:
  {}nPn = \frac{n!}{(n-n)!} = n!.
• Example 8: Six letters A, B, C, D, E, F; select 3 without replacement; order matters.
  • Number of distinct permutations: {}6P3 = \frac{6!}{(6-3)!} = \frac{6!}{3!} = 120.

Combinations: Rule (without replacement & order does not count)

• Idea: No. of different combinations when selecting $r$ items from $n$ distinct items, where order does not matter:
  {}nCr = \frac{n!}{(n-r)!\, r!} .
• Note: ${}nCr = {}nPr / r!$ as a relation between combinations and permutations when selecting without replacement.
• Example 9: Six letters A, B, C, D, E, F; select 3 without replacement; order does not matter.
  • Number of combinations: {}6C3 = \frac{6!}{(6-3)!\, 3!} = \frac{6!}{3!\,3!} = 20.
• Example 10: Ice-cream flavours: Banana, Chocolate, Lemon, Strawberry, Vanilla (5 flavours); choose 4 distinct flavours (order does not matter):
  {}5C4 = \frac{5!}{(5-4)!\, 4!} = \frac{5!}{4!} = 5.

Counting with/without replacement: overview

• Without replacement, order matters: {}nPr = \frac{n!}{(n-r)!}
• Without replacement, order does not matter: {}nCr = \frac{n!}{(n-r)!\, r!}
• With replacement (order matters): n^r
• With replacement (order does not matter): The standard formula is not simply stated here, but combinations with repetition relate to multisets and can be approached with stars-and-bars in general.
• For reference in transcript: a chart links these concepts as follows:
  • Permutation row arrangement circle arrangement: all items selected, order matters, distinctions based on whether items are identical or not.
  • When there are identical items, use the division by the factorials of identical counts.
  • When every item is unique and order matters (no replacement), use ${}nPr$.

Examples consolidated from transcript

• Example 1 (Permutations without replacement, all unique): 7 letters arranged in a row
  • Number of arrangements: 7! = 5040.
• Example 2 (Circle arrangement with all unique items): 7 letters arranged in a circle
  • Number of distinct circular arrangements: (7-1)! = 720.
• Example 3 (Identical items, without replacement, in a row): 14 balls with 4R, 2B, 3G, 5P
  • Number of distinct permutations in a row: \frac{14!}{4!\,2!\,3!\,5!}.
• Example 4 (Identical items, circle arrangements): 14 balls with 4R, 2B, 3G, 5P
  • Number of distinct circular permutations: \frac{14!}{14\,4!\,2!\,3!\,5!} = \frac{(14-1)!}{4!\,2!\,3!\,5!}.
• Example 5 (LAPTOP around a circle):
  • Letters L, A, P, T, O, P with P repeated twice.
  • Circular permutations: \frac{(6-1)!}{2!} = 60.
• Example 6 (STATISTICS around a circle):
  • Letters: S(3), T(3), A(1), I(2), C(1); total 10 letters.
  • Circular permutations: \frac{(10-1)!}{3!\,3!\,2!} = 5040.
• Example 7 (5 draws from a bag with 4R, 3Y):
  • Distinct row arrangements across distributions: 4R1Y → 5, 3R2Y → 10, 2R3Y → 10; total 25.
• Example 8 (Without replacement, all items unique, order matters): 6 letters, select 3
  • {}6P3 = \frac{6!}{(6-3)!} = 120.
• Example 9 (Without replacement, order does not matter): 6 letters, select 3
  • {}6C3 = \frac{6!}{(6-3)!\, 3!} = 20.
• Example 10 (With/without replacement summary): Distinctions between permutations and combinations summarized and cross-referenced with sample spaces.

Quick reference: key formulas to memorize

• Factorial:
  • n! = n\times(n-1)\times\cdots\times 1, \quad 0! = 1.
• Permutations (order matters, without replacement, distinct items):
  • {}nPr = \frac{n!}{(n-r)!}.
• Permutations with identical items: if counts are $n1, n2, \dots, nk$ with $\sum ni = n$,
  • \frac{n!}{n1!\,n2!\cdots n_k!} .
• Circle permutations (all items distinct):
  • (n-1)! .
• Circle permutations with duplicates: for item multiplicities $n1, n2, \dots, n_k$,
  • \frac{(n-1)!}{n1!\,n2!\cdots n_k!} .
• Permutations (distinct items, all $n$ selected, order matters):
  • {}nPn = n!
• Combinations (order does not matter, without replacement):
  • {}nCr = \frac{n!}{(n-r)!\, r!}
• With replacement (order matters):
  • n^r $$
• With replacement (order does not matter): related to combinations with repetition (stars-and-bars framework, not explicitly listed in transcript).

Quick notes on terminology mentioned in transcript

• Observation, Hypothesis, Null hypothesis, Alternative hypothesis
• False negative, True positive
• Confidence interval, Sampling, Population & sample concepts
• Poisson distribution, Normal distribution, Binomial distribution, Chi-square, Variance, Standard deviation, Mean, Median, Histogram
• Tree diagrams, Addition rule, Multiplication rule, Probabilities, Probability 2, Conditional probability, Bayes’ rule
• These items appear as a glossary and context for broader statistics topics beyond the counting-focused portion presented here.

Connections and real-world relevance

• Understanding counting principles is foundational for probability calculations in experiments, surveys, and data analysis.
• Distinguishing between when order matters (permutations) versus when it does not (combinations) prevents overcounting or undercounting in practical problems.
• Circular arrangements capture symmetry in many real-world scenarios such as seating people around a table.
• Handling duplicates is essential in problems involving indistinguishable items (e.g., cards of the same suit, beads of the same color) to avoid overcounting.
• The replacement vs non-replacement distinction mirrors many real-world processes: drawing cards with/without replacement, sampling from populations with/without returning units.

Ethical, philosophical, or practical implications discussed

• The counting framework emphasizes precision in modeling real-world processes; mistakes in counting can lead to incorrect inferences or biased conclusions in data analysis.
• Understanding these principles supports transparent and reproducible reasoning in statistics, which is critical for evidence-based decision making.