IntelliX Senior STEM Resources

MDM4U Grade 12 Data Management — Exam Formula Sheet & Reference

Ontario Ministry of Education Curriculum Aligned

1. Organized Counting & Permutations (Order Matters)

  • Fundamental Counting Principle: If event A has m outcomes and event B has n outcomes, total combined outcomes = m · n.
  • Factorial: n! = n · (n - 1) · (n - 2) · ... · 1 with definition 0! = 1.
  • Permutations of n items taken r at a time: nPr = n! / (n - r)!
  • Permutations with Indistinguishable / Repeated Items: Total = n! / (a! · b! · c!)
  • Circular Permutations: Arranging n distinct items in a closed circle = (n - 1)!. (If flipping is possible, like a key ring, divide by 2: (n - 1)! / 2).

2. Combinations & Pascal's Identity (Order Does NOT Matter)

  • Combinations formula: nCr = C(n, r) = n! / [r! · (n - r)!]
  • Symmetry Property: nCr = nC(n - r)
  • Pascal's Identity: C(n, r) = C(n - 1, r - 1) + C(n - 1, r)
  • Binomial Theorem: (a + b)ⁿ = Σ [C(n, k) · a^(n-k) · b^k] for k = 0 to n
  • General (k + 1)th Term: t_(k+1) = C(n, k) · a^(n-k) · b^k
  • Total Subsets of a Set with n Elements: 2ⁿ = C(n, 0) + C(n, 1) + ... + C(n, n)

3. Probability Foundations & Set Theory

  • Theoretical Probability: P(A) = n(A) / n(S)
  • Complement: P(A') = 1 - P(A)
  • Odds in Favour of A: P(A) : P(A') or n(A) : n(A')
  • Addition Rule (General): P(A ∪ B) = P(A) + P(B) - P(A ∩ B)
  • Mutually Exclusive Events: P(A ∩ B) = 0 ⟹ P(A ∪ B) = P(A) + P(B)
  • Conditional Probability: P(A | B) = P(A ∩ B) / P(B) (where P(B) > 0)
  • Multiplication Rule: P(A ∩ B) = P(A) · P(B | A)
  • Independent Events Test: Events A and B are independent if and only if P(A ∩ B) = P(A) · P(B).

4. Discrete Probability Distributions Reference

Binomial Distribution B(n, p) [Independent, With Replacement]:

P(X = k) = C(n, k) · p^k · (1 - p)^(n - k)

Mean / Expected Value: E(X) = μ = n · p | Standard Deviation: σ = √(n · p · (1 - p))

Hypergeometric Distribution [Dependent, WITHOUT Replacement, Population N, Successes a, Sample n]:

P(X = k) = [C(a, k) · C(N - a, n - k)] / C(N, n)

Mean / Expected Value: E(X) = (n · a) / N

Geometric Distribution [Waiting time until first success]:

P(X = k) = (1 - p)^(k - 1) · p

Expected Waiting Time: E(X) = 1 / p (or (1-p)/p depending on textbook indexing).

5. Normal Distributions & Inferential Statistics

  • Standardized Z-Score: z = (x - μ) / σ
  • Empirical 68-95-99.7 Rule:
    • 68.3% of values fall within μ ± 1σ
    • 95.4% of values fall within μ ± 2σ
    • 99.7% of values fall within μ ± 3σ
  • Margin of Error for Proportions (95% Confidence): ME = 1.96 · √[p̂(1 - p̂) / n]
  • Pearson Correlation Coefficient r: Ranges from -1.0 (perfect negative) to +1.0 (perfect positive). Strong correlation: |r| > 0.70.
  • Linear Regression Slope: m = r · (s_y / s_x) | Intercept: b = ȳ - m · x̄

Score 90%+ in MDM4U with 1-on-1 Tutoring

Struggling with permutations cases, Pascal's pathway grids, or continuous z-score calculations? Work 1-on-1 with an Ontario Data Management specialist at IntelliX.