MIT 6.041 Probability Counting

Summary

This partial ingest is based on a clipped MIT 6.041 probability-counting lecture note. The note presents finite equiprobable sample spaces, permutations, subsets, binomial coefficients, binomial probabilities, conditional counting, and card-dealing partition arguments as basic tools for turning combinatorics into probability calculations.

Key Claims

• When all finite sample points are equally likely, probabilities reduce to ratios of counts.
• Permutations, subsets, and binomial coefficients are the core counting objects needed for many introductory probability problems.
• Binomial coefficients connect counting directly to Bernoulli trial probabilities.
• Conditional probability questions can often be solved by counting the favorable configurations inside the conditioned set.
• Partition-style arguments are useful when outcomes are allocated across several groups, as in card deals.

Methods / Formalism

• For a finite equiprobable sample space Omega and event A,

$$P(A)=\frac{|A|}{|\Omega |}.$$

• The number of orderings of n distinct objects is n!; the number of subsets of an n-element set is 2^n.
• The number of k-element subsets is

$$\left(\genfrac{}{}{0ex}{}{n}{k}\right)=\frac{n!}{k!(n-k)!},$$

with boundary cases binom(n,0)=binom(n,n)=1 and identity sum_{k=0}^n binom(n,k)=2^n.

• For n independent coin tosses with head probability p,

$$P(\text{exactly }k\text{ heads})=\left(\genfrac{}{}{0ex}{}{n}{k}\right)p^k(1-p{)}^{n-k}.$$

• See Finite Probability Counting Rules for the reusable derivation of the counting identities.

Evidence / Experiments

• The note uses a conditional coin-toss example: given exactly three heads in ten tosses, the probability that the first two tosses were heads is binom(8,1)/binom(10,3).
• It also uses a card-dealing example: count all four-player thirteen-card deals, then count favorable deals where each player receives exactly one ace.
• This is pedagogical material, so its value is foundational rather than empirical.

Connections

• Seeds Counting in Probability as a reusable foundation concept.
• The formula payload is separated into Finite Probability Counting Rules.
• Provides background for Probability and Statistics, especially finite sample spaces and discrete distributions.
• Connects to Jaffray2026 - Floyd’s Sampling Algorithm, where exact subset sampling operationalizes uniform selection from finite sets.
• Lightly supports Algorithms and Data Structures through combinatorial counts, factorial growth, and sampling procedures.

Open Questions

• Which counting identities recur often enough in the wiki to deserve a dedicated combinatorics annex?
• Should the wiki separate finite combinatorics from probability foundations once more discrete probability sources are ingested?

Citation

MIT 6.041. (2026 clip). Probability Counting. Course note / lecture clip.