Ninth Grade Mathematics: Coin, Die, and Card Distributions & Simulations
While theoretical mathematics calculates exact fractional probabilities, modern scientific research, cryptography, and artificial intelligence rely heavily on probability simulations. A simulation is the process of modeling a random process using physical trials or computer algorithms to study the behavior of complex probability distributions. In this chapter, you will master the analysis of distributions for coins, dice, and cards, and explore how computer-generated pseudo-random numbers simulate thousands of trials in seconds.
Probability Distributions
A probability distribution is a complete mathematical description of all possible values of a random variable along with their associated probabilities. For any valid probability distribution, two conditions must hold:
1. Each individual probability P(x) must satisfy 0 <= P(x) <= 1.
2. The sum of all probabilities across the entire distribution must equal exactly 1: Sigma P(x) = 1.
Probability Distribution for the Number of Heads in 2 Coin Tosses:
Sample Space: S = {TT, HT, TH, HH} ===> n(S) = 4
Number of Heads (X) Favorable Outcomes Frequency Probability P(X)
---------------------------------------------------------------------------
0 {TT} 1 1/4 = 0.25
1 {HT, TH} 2 2/4 = 0.50
2 {HH} 1 1/4 = 0.25
---------------------------------------------------------------------------
Total 4 Sigma P = 1.00
Notice that getting 1 Head is twice as likely as getting 0 Heads or 2 Heads.
The Two-Dice Sum Distribution
When two standard dice are rolled simultaneously, the sum of their faces ranges from 2 to 12. The distribution is not uniform; it forms a symmetric triangular distribution peaked at the central sum of 7:
The 36-Outcome Sum Grid:
Die 1 \ Die 2 1 2 3 4 5 6
-----------------------------------
1 2 3 4 5 6 7
2 3 4 5 6 7 8
3 4 5 6 7 8 9
4 5 6 7 8 9 10
5 6 7 8 9 10 11
6 7 8 9 10 11 12
Sum (S) Favorable Pairs Count Probability P(S)
--------------------------------------------------------------------------------
2 (1,1) 1 1/36
3 (1,2), (2,1) 2 2/36 = 1/18
4 (1,3), (2,2), (3,1) 3 3/36 = 1/12
5 (1,4), (2,3), (3,2), (4,1) 4 4/36 = 1/9
6 (1,5), (2,4), (3,3), (4,2), (5,1) 5 5/36
7 (1,6), (2,5), (3,4), (4,3), (5,2), (6,1) 6 6/36 = 1/6 (Peak!)
8 (2,6), (3,5), (4,4), (5,3), (6,2) 5 5/36
9 (3,6), (4,5), (5,4), (6,3) 4 4/36 = 1/9
10 (4,6), (5,5), (6,4) 3 3/36 = 1/12
11 (5,6), (6,5) 2 2/36 = 1/18
12 (6,6) 1 1/36
The sum 7 is the most probable outcome because it has 6 distinct combinations, giving P(7) = 6/36 = 1/6.
Computer Simulation and the Monte Carlo Method
In the 1940s, mathematicians Stanislaw Ulam and John von Neumann invented the Monte Carlo Method—using computer algorithms to simulate millions of random trials to estimate complex probabilities that are mathematically intractable to calculate by hand.
Monte Carlo Simulation Protocol:
1. Define the physical system and random variables.
2. Generate thousands of pseudo-random numbers using a computer.
3. Track the frequency of simulated successes.
4. Apply the Law of Large Numbers:
Estimated Probability = Simulated Successes / Total Simulations.
A Python simulation script to model 10,000 rolls of two dice and estimate P(Sum = 7) illustrates this process:
import random
trials = 10000
sum_7_count = 0
for _ in range(trials):
die1 = random.randint(1, 6)
die2 = random.randint(1, 6)
if die1 + die2 == 7:
sum_7_count += 1
simulated_probability = sum_7_count / trials
print(f"Simulated P(7): {simulated_probability:.4f}")
# Typical output: 0.1664 (Theoretical value is 1/6 = 0.1667)
Within a fraction of a second, the computer executes 10,000 trials, and the Law of Large Numbers drives the simulated probability within a fraction of a percent of the theoretical value 1/6.
Chapter Exercises
Exercise 1: When three fair coins are tossed simultaneously, find the probability distribution for the number of Heads obtained (X = 0, 1, 2, or 3). Construct a table showing each value of X and its probability, verifying that the probabilities sum to 1.
Exercise 2: Two dice are rolled simultaneously. Find the probability that: (a) the sum of the numbers is 8; (b) the sum of the numbers is greater than 9; (c) the sum is at least 10.
Exercise 3: Explain how a Monte Carlo computer simulation can be used to approximate the mathematical constant pi by randomly scattering points inside a square enclosing a circle.
Solutions and Explanations
Solution 1: When tossing three coins, the sample space has n(S) = 2^3 = 8 outcomes: {TTT, HTT, THT, TTH, HHT, HTH, THH, HHH}. Let X be the number of Heads: for X = 0, the only outcome is {TTT}, so P(X = 0) = 1/8. For X = 1, favorable outcomes are {HTT, THT, TTH}, so P(X = 1) = 3/8. For X = 2, favorable outcomes are {HHT, HTH, THH}, so P(X = 2) = 3/8. For X = 3, the only outcome is {HHH}, so P(X = 3) = 1/8. The distribution is: X = 0 with P = 1/8; X = 1 with P = 3/8; X = 2 with P = 3/8; X = 3 with P = 1/8. Verification: Sum = 1/8 + 3/8 + 3/8 + 1/8 = 8/8 = 1.00.
Solution 2: Total number of outcomes is 36. For (a), the pairs summing to 8 are {(2,6), (3,5), (4,4), (5,3), (6,2)}, which is 5 pairs. P(Sum = 8) = 5/36. For (b), sums greater than 9 are 10, 11, and 12. Pairs summing to 10 are {(4,6), (5,5), (6,4)} (3 pairs); pairs summing to 11 are {(5,6), (6,5)} (2 pairs); pair summing to 12 is {(6,6)} (1 pair). Total favorable pairs = 3 + 2 + 1 = 6 pairs. P(Sum > 9) = 6/36 = 1/6. For (c), 'at least 10' means 10, 11, or 12, which is the exact same condition as sum greater than 9: P(Sum >= 10) = 6/36 = 1/6.
Solution 3: Consider a square with side length 2r centered at the origin, with an inscribed circle of radius r. The area of the square is (2r)^2 = 4*r^2, and the area of the inscribed circle is pi * r^2. If a computer generates N random points uniformly distributed across the square, the probability that any given point falls inside the circle is the ratio of their areas: P(inside circle) = (pi * r^2) / (4 * r^2) = pi / 4. By the Law of Large Numbers, the proportion of generated points that land inside the circle (Points_inside / Total_points N) approaches pi / 4 as N grows large. Therefore: pi approx 4 * (Points_inside / Total_points N). By generating millions of random coordinates and testing whether x^2 + y^2 <= r^2, the Monte Carlo method provides an accurate numerical approximation of pi.