Fundamental Principles of Counting

Table of Contents
1. I. The Addition Rule
2. II. The Product Rule (Multiplication Rule)
3. Generalisation of the Addition and Product Rules
4. Mutually Exclusive vs Independent: A short note
5. Event and Its Trials (Repeated Trials)
6. Solved Example
7. Additional remarks and common techniques
View more

Fundamental Principles of Counting

I. The Addition Rule

Suppose there are two events A and B. Let the number of possible outcomes of A be n(A) and the number of possible outcomes of B be n(B). If A and B are mutually exclusive (they have no outcome in common), and E denotes the event "either A occurs or B occurs", then the number of possible outcomes of E is given by:

n(E) = n(A) + n(B)

This statement is called the Addition Rule of counting. It applies whenever two or more choices cannot happen together (mutually exclusive options). The rule generalises to any finite number of mutually exclusive alternatives.

Question: Jacob goes to a shop to buy some ping pong balls. He wishes to choose one ball from the amateur section, which had a total of five balls; or one ball from the professional section, which had a total of three balls. How many ways are possible in which he can buy a ball i.e. he can buy one ball from the amateur section OR one ball from the professional section?

Solution: 

n(Jacob buying a ball) = n(Jacob buys one ball from the amateur section) + n(Jacob buys one ball from the professional section)

n(Jacob buying a ball) = ⁵C₁ + ³C₁

n(Jacob buying a ball) = 5 + 3

n(Jacob buying a ball) = 8

Hence, there are 8 possible ways for Jacob to buy one ball according to the given condition.

II. The Product Rule (Multiplication Rule)

Suppose there are two events A and B. Let the number of possible outcomes of A be n(A) and of B be n(B). If the occurrence of A does not affect the occurrence of B (that is, the events are independent in the sense of choices), and E denotes the event "both A and B occur", then the number of possible outcomes of E is:

n(E) = n(A) × n(B)

This is called the Product Rule or the Fundamental Counting Principle. It extends in a natural way to several independent choices: multiply the number of options at each stage.

Question: Jacob goes to a sports shop to buy a ping pong ball and a tennis ball. There is a total of five ping pong balls and 3 tennis balls available in the shop. In how many ways can Jacob buy a ping pong ball and a tennis ball?

Solution: 

The choice of a ping pong ball is independent of the choice of a tennis ball.

n(Jacob buys one ping pong ball and one tennis ball) = n(Jacob buys a ping pong ball) × n(Jacob buys a tennis ball)

n(Jacob buys both) = ⁵C₁ × ³C₁

n(Jacob buys both) = 5 × 3

n(Jacob buys both) = 15

Thus, there are 15 different ways in which Jacob can buy one ping pong ball and one tennis ball.

Generalisation of the Addition and Product Rules

Addition rule (generalised): If P₁, P₂, ..., P_n are mutually exclusive alternatives with numbers of ways n(P₁), n(P₂), ..., n(P_n), then the number of ways in which either one of these alternatives can occur is

n(E) = n(P₁) + n(P₂) + ... + n(P_n)

Product rule (generalised): If P₁, P₂, ..., P_n are successive independent choices with numbers of ways n(P₁), n(P₂), ..., n(P_n), then the number of ways in which all choices can be made is

n(E) = n(P₁) × n(P₂) × ... × n(P_n)

In counting problems, it is important to check whether alternatives are mutually exclusive (use addition) or choices are made in sequence and independent (use multiplication). If choices are not independent, multiply after adjusting for the dependence (for example, by conditional counting). If options are overlapping (not mutually exclusive), use inclusion-exclusion to avoid double counting.

Mutually Exclusive vs Independent: A short note

Mutually exclusive means two options cannot happen together (for instance, choosing a red ball OR a blue ball from a set where each ball has a single colour).

Independent choices means the number of options available at one stage does not change because of the choice made at another stage (for instance, choosing a shirt and a pair of trousers from two separate racks).

Event and Its Trials (Repeated Trials)

Let an experiment or event E have m possible outcomes. If the experiment is repeated n times and each trial is independent (the outcomes of different trials do not affect each other), then the total number of possible outcomes of the sequence of n trials is

mⁿ

For example, repeating a die throw 3 times gives 6 × 6 × 6 = 6³ = 216 possible outcome sequences. This formula assumes identical conditions on each trial and independence of trials.

Solved Example

Question: A coin is tossed 50 times. What is the number of possible outcomes of this experiment?

Solution: 

A coin has two possible outcomes on a single toss: heads or tails.

Each toss is independent of every other toss.

The number of possible outcomes of 50 independent tosses = 2 × 2 × 2 × ... (50 times)

The number of possible outcomes = 2⁵⁰

Therefore, the experiment has 2⁵⁰ possible outcome sequences.

Additional remarks and common techniques

• Tree diagrams are useful visual tools to represent sequential choices and to apply the product rule clearly.
• When alternatives overlap, use the principle of inclusion-exclusion: for two events A and B, n(A ∪ B) = n(A) + n(B) - n(A ∩ B).
• Carefully distinguish between "with replacement" (independent trials) and "without replacement" (dependence between trials) when counting repeated draws.
• For many competitive and board-exam problems, break the task into stages, count choices at each stage, and then combine using addition or multiplication as appropriate.

Summary (optional): Use the Addition Rule for mutually exclusive alternatives and the Product Rule for independent sequential choices. For repeated independent trials of an experiment with m possible outcomes, the total number of sequences of length n is mⁿ. Check carefully for mutual exclusivity and independence before applying these rules.