Classical Definition of Probability: Explained with Examples

Tossing a fair coin has 2 equally likely outcomes, 1 favourable to heads, so P(head) = 1/2. Rolling a fair die has 6 equally likely outcomes, 3 favourable to an even number, so P(even) = 3/6 = 1/2.

This definition matters because it turns counting into probability. It is why probability chapters spend so much time on permutations and combinations: those counting tools feed directly into this formula. But the definition only works when its conditions hold, and knowing its limits is as important as knowing the formula.

Key Concepts

• Equally likely outcomes: the core assumption; each outcome of the sample space has the same chance, true for fair coins, fair dice and well-shuffled decks.
• Favourable outcomes (m): the outcomes in the sample space belonging to event A, counted as a whole number.
• Total outcomes (n): the number of outcomes in the sample space S, which must be finite.
• Range of P(A): since 0 ≤ m ≤ n, the definition always gives 0 ≤ P(A) ≤ 1, with P(impossible) = 0 and P(sure) = 1.
• Odds: a different idea; the odds in favour of A are m : (n − m), not the probability m/n.

Formulas

The defining formula is P(A) = m / n, where m is the number of outcomes favourable to A and n is the total number of equally likely outcomes. Two conditions must both hold: the sample space is finite and all outcomes are equally likely. The complement comes free: P(not A) = (n − m)/n = 1 − m/n. Everything else in this chapter agrees with this definition whenever it applies.

Worked Example

Two fair dice are rolled. Find the probability that the sum is 9. The sample space has 6 × 6 = 36 equally likely ordered pairs, so n = 36. The pairs giving sum 9 are (3, 6), (4, 5), (5, 4) and (6, 3), so m = 4. Therefore P(sum = 9) = 4/36 = 1/9. Note the careful counting: (3, 6) and (6, 3) are different outcomes because the dice are distinct. Counting unordered pairs would give m = 2 and the wrong answer, because unordered pairs are not equally likely.

Common Misconceptions

• The definition works for any experiment: It does not. With a biased coin, m/n is meaningless, and with an infinite sample space like waiting time, you cannot count n at all.
• Distinct outcomes may be merged: Only genuinely distinct, equally likely outcomes may go into n; collapsing (3, 6) and (6, 3) into one destroys equal likelihood.
• Probability 1/2 means half the time in a few trials: The classical definition says nothing about short-run frequencies; 3 heads in 4 tosses is fully consistent with P(head) = 1/2.

Real-World Applications

The classical definition powers every game of chance: lotteries compute jackpot odds as 1 divided by the number of equally likely ticket combinations, casinos price roulette bets from 37 or 38 layouts, and card players evaluate hands by counting favourable 5-card selections. Quality inspectors sampling batches use the same ratio logic, and genetics uses it too: offspring trait ratios are classical probabilities from counting equally likely allele combinations.

The classical definition says P(A) = m/n for n equally likely outcomes with m favourable, provided the sample space is finite and every outcome is equally likely. It converts counting into chance and underlies games, lotteries and sampling. Its limits, biased outcomes and infinite sample spaces, motivated the statistical and axiomatic definitions that came later.