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×n .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
    • nrn^r
    • Example: 26-letter alphabet (A–Z), choosing 5 positions with replacement yields 265=11881376.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=n!(n−r)! .{}<em>nP</em>r = \frac{n!}{(n-r)!} \,.
    • If you select all $n$ items (i.e., $r=n$): <em>nP</em>n=n!(n−n)!=n!.</li></ul></li></ul><h3id="factorial">Factorial</h3><ul><li>Definition:{}<em>nP</em>n = \frac{n!}{(n-n)!} = n!.</li></ul></li> </ul> <h3 id="factorial">Factorial</h3> <ul> <li>Definition:n! = n \times (n-1) \times (n-2) \times \cdots \times 1.</li><li>Specialcase:</li> <li>Special case:0! = 1.</li><li>Uses:foundationalforpermutations,combinations,andmanycountingformulas.</li></ul><h3id="permutationsgeneralconcepts">Permutations:generalconcepts</h3><ul><li>Permutationsarearrangementswhereordermatters.</li><li>Distinctions:<ul><li>Permutations(ordercounts)withoutreplacement(allitemsdistinct):</li> <li>Uses: foundational for permutations, combinations, and many counting formulas.</li> </ul> <h3 id="permutationsgeneralconcepts">Permutations: general concepts</h3> <ul> <li>Permutations are arrangements where order matters.</li> <li>Distinctions:<ul> <li>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!} .</li></ul></li><li>Example4(REVISIT):arrange14coloredballsinacirclewiththesamemultiplicities.<ul><li>Numberofcircularpermutations:<br/></li></ul></li> <li>Example 4 (REVISIT): arrange 14 colored balls in a circle with the same multiplicities.<ul> <li>Number of circular permutations:<br /> \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!} .</li></ul></li><li>Example5:Lettersfromtheword“LAPTOP”arrangedaroundacircle.<ul><li>LAPTOPhas6letterswiththeletterPappearingtwice.</li><li>Circulararrangementswithduplicates:<br/></li></ul></li> <li>Example 5: Letters from the word “LAPTOP” arranged around a circle.<ul> <li>LAPTOP has 6 letters with the letter P appearing twice.</li> <li>Circular arrangements with duplicates:<br /> \frac{(6-1)!}{2!} = \frac{5!}{2!} = 60. </li></ul></li><li>Example6:Lettersfromtheword“STATISTICS”arrangedaroundacircle.<ul><li>Letters:S(3),T(3),A(1),I(2),C(1)→total10letters.</li><li>Distinctcirculararrangements:<br/></li></ul></li> <li>Example 6: Letters from the word “STATISTICS” arranged around a circle.<ul> <li>Letters: S(3), T(3), A(1), I(2), C(1) → total 10 letters.</li> <li>Distinct circular arrangements:<br /> \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!. </li><li>Example8:SixlettersA,B,C,D,E,F;select3withoutreplacement;ordermatters.<ul><li>Numberofdistinctpermutations:</li> <li>Example 8: Six letters A, B, C, D, E, F; select 3 without replacement; order matters.<ul> <li>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. </li></ul></li><li>Example10:Ice−creamflavours:Banana,Chocolate,Lemon,Strawberry,Vanilla(5flavours);choose4distinctflavours(orderdoesnotmatter):<br/></li></ul></li> <li>Example 10: Ice-cream flavours: Banana, Chocolate, Lemon, Strawberry, Vanilla (5 flavours); choose 4 distinct flavours (order does not matter):<br /> {}5C4 = \frac{5!}{(5-4)!\, 4!} = \frac{5!}{4!} = 5. </li></ul><h3id="countingwithwithoutreplacementoverview">Countingwith/withoutreplacement:overview</h3><ul><li>Withoutreplacement,ordermatters:</li> </ul> <h3 id="countingwithwithoutreplacementoverview">Counting with/without replacement: overview</h3> <ul> <li>Without replacement, order matters: {}nPr = \frac{n!}{(n-r)!} </li><li>Withoutreplacement,orderdoesnotmatter:</li> <li>Without replacement, order does not matter: {}nCr = \frac{n!}{(n-r)!\, r!} </li><li>Withreplacement(ordermatters):</li> <li>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.</li></ul></li><li>Example2(Circlearrangementwithalluniqueitems):7lettersarrangedinacircle<ul><li>Numberofdistinctcirculararrangements:</li></ul></li> <li>Example 2 (Circle arrangement with all unique items): 7 letters arranged in a circle<ul> <li>Number of distinct circular arrangements: (7-1)! = 720. </li></ul></li><li>Example3(Identicalitems,withoutreplacement,inarow):14ballswith4R,2B,3G,5P<ul><li>Numberofdistinctpermutationsinarow:</li></ul></li> <li>Example 3 (Identical items, without replacement, in a row): 14 balls with 4R, 2B, 3G, 5P<ul> <li>Number of distinct permutations in a row: \frac{14!}{4!\,2!\,3!\,5!}. </li></ul></li><li>Example4(Identicalitems,circlearrangements):14ballswith4R,2B,3G,5P<ul><li>Numberofdistinctcircularpermutations:</li></ul></li> <li>Example 4 (Identical items, circle arrangements): 14 balls with 4R, 2B, 3G, 5P<ul> <li>Number of distinct circular permutations: \frac{14!}{14\,4!\,2!\,3!\,5!} = \frac{(14-1)!}{4!\,2!\,3!\,5!}. </li></ul></li><li>Example5(LAPTOParoundacircle):<ul><li>LettersL,A,P,T,O,PwithPrepeatedtwice.</li><li>Circularpermutations:</li></ul></li> <li>Example 5 (LAPTOP around a circle): <ul> <li>Letters L, A, P, T, O, P with P repeated twice.</li> <li>Circular permutations: \frac{(6-1)!}{2!} = 60. </li></ul></li><li>Example6(STATISTICSaroundacircle):<ul><li>Letters:S(3),T(3),A(1),I(2),C(1);total10letters.</li><li>Circularpermutations:</li></ul></li> <li>Example 6 (STATISTICS around a circle):<ul> <li>Letters: S(3), T(3), A(1), I(2), C(1); total 10 letters.</li> <li>Circular permutations: \frac{(10-1)!}{3!\,3!\,2!} = 5040. </li></ul></li><li>Example7(5drawsfromabagwith4R,3Y):<ul><li>Distinctrowarrangementsacrossdistributions:4R1Y→5,3R2Y→10,2R3Y→10;total25.</li></ul></li><li>Example8(Withoutreplacement,allitemsunique,ordermatters):6letters,select3<ul><li></li></ul></li> <li>Example 7 (5 draws from a bag with 4R, 3Y):<ul> <li>Distinct row arrangements across distributions: 4R1Y → 5, 3R2Y → 10, 2R3Y → 10; total 25.</li></ul></li> <li>Example 8 (Without replacement, all items unique, order matters): 6 letters, select 3<ul> <li> {}6P3 = \frac{6!}{(6-3)!} = 120. </li></ul></li><li>Example9(Withoutreplacement,orderdoesnotmatter):6letters,select3<ul><li></li></ul></li> <li>Example 9 (Without replacement, order does not matter): 6 letters, select 3<ul> <li> {}6C3 = \frac{6!}{(6-3)!\, 3!} = 20. </li></ul></li><li>Example10(With/withoutreplacementsummary):Distinctionsbetweenpermutationsandcombinationssummarizedandcross−referencedwithsamplespaces.</li></ul><h3id="quickreferencekeyformulastomemorize">Quickreference:keyformulastomemorize</h3><ul><li>Factorial:<ul><li></li></ul></li> <li>Example 10 (With/without replacement summary): Distinctions between permutations and combinations summarized and cross-referenced with sample spaces.</li> </ul> <h3 id="quickreferencekeyformulastomemorize">Quick reference: key formulas to memorize</h3> <ul> <li>Factorial:<ul> <li>n! = n\times(n-1)\times\cdots\times 1, \quad 0! = 1.</li></ul></li><li>Permutations(ordermatters,withoutreplacement,distinctitems):<ul><li></li></ul></li> <li>Permutations (order matters, without replacement, distinct items):<ul> <li> {}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!} .</li></ul></li><li>Circlepermutations(allitemsdistinct):<ul><li></li></ul></li> <li>Circle permutations (all items distinct):<ul> <li> (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! </li></ul></li><li>Combinations(orderdoesnotmatter,withoutreplacement):<ul><li></li></ul></li> <li>Combinations (order does not matter, without replacement):<ul> <li> {}nCr = \frac{n!}{(n-r)!\, r!} </li></ul></li><li>Withreplacement(ordermatters):<ul><li></li></ul></li> <li>With replacement (order matters):<ul> <li> 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.