Analyzing the Setup
Imagine you are standing in front of a massive library containing numbered cards from 1 to 2000. Your universal set is defined as S={1,2,3,…,2000}.
The total number of possible outcomes, denoted by N, is 2000. We are tasked with finding the probability of picking a number that is a multiple of 3 or a multiple of 7.
Defining the Circles of Influence
Let Event A be picking a multiple of 3, and Event B be picking a multiple of 7. We seek the number of elements in the union of these two events, A∪B.
To determine the count of multiples of k up to N, we use the floor function ⌊kN⌋.
For Event
A:
n(A)=⌊32000⌋=⌊666.66…⌋=666
For Event
B:
n(B)=⌊72000⌋=⌊285.71…⌋=285
The Trap of Double Counting
If we simply add n(A) and n(B), we count numbers that are multiples of both 3 and 7 twice. These numbers reside in the intersection A∩B.
Since these numbers must be divisible by both 3 and 7, they are multiples of their Least Common Multiple,
LCM(3,7)=21. We calculate the intersection count as:
n(A∩B)=⌊212000⌋=⌊95.23…⌋=95
Applying the
Principle of Inclusion-Exclusion, we find the total number of favorable outcomes:
n(A∪B)=n(A)+n(B)−n(A∩B)
n(A∪B)=666+285−95=856
Final Calculation
We have 856 favorable outcomes out of 2000. The probability
p is given by:
p=2000856
The problem asks for the value of
500p. Substituting our value for
p:
500p=500×(2000856)
Since
500 goes into
2000 exactly 4 times, the expression simplifies to:
500p=4856=214
The final result is 214.