Analyzing the Setup
Imagine you are standing in front of a bag containing fifty slips of paper, each numbered from 1 to 50. You are asked to pick one at random, and you want to know the probability that the number you pick is a multiple of 4, 6, or 7.
We define our sample space S={1,2,…,50}, where the total number of outcomes is n(S)=50. To solve this, we define three sets: A for multiples of 4, B for multiples of 6, and C for multiples of 7.
The Counting Machine
To count the multiples of a number k up to 50, we use the floor function ⌊k50⌋.
For set
A, we calculate:
n(A)=⌊450⌋=12
For set
B, we find:
n(B)=⌊650⌋=8
For set
C, we find:
n(C)=⌊750⌋=7
The Overlap Trap
Some numbers are multiples of both 4 and 6, such as 12 or 24. These numbers have been counted in both set A and set B. To correct this, we must find the intersection of these sets using the Least Common Multiple (LCM).
For
A and
B,
LCM(4,6)=12, so:
n(A∩B)=⌊1250⌋=4
For
B and
C,
LCM(6,7)=42, so:
n(B∩C)=⌊4250⌋=1
For
A and
C,
LCM(4,7)=28, so:
n(A∩C)=⌊2850⌋=1
For the triple intersection
n(A∩B∩C), we look for multiples of
LCM(4,6,7)=84. Since 84 is greater than 50, there are zero such numbers:
n(A∩B∩C)=0
The Inclusion-Exclusion Principle
We now apply the Principle of Inclusion-Exclusion to find the union
n(A∪B∪C). The formula is:
n(A∪B∪C)=n(A)+n(B)+n(C)−[n(A∩B)+n(B∩C)+n(A∩C)]+n(A∩B∩C)
Substituting our values, we get:
n(A∪B∪C)=12+8+7−(4+1+1)+0
n(A∪B∪C)=27−6=21
We have identified 21 favorable outcomes.
Final Calculation
The probability P is the ratio of favorable outcomes to total outcomes.
This elegant result shows how structured thinking can turn a complex counting problem into a simple, satisfying solution. The final probability is 0.42.