Let . If and , then the number of elements in the smallest subset of X, containing both A and B, is
We begin by fixing the universal set. By definition we have Thus every natural number from to is in .
Next we describe the two given subsets. The first is
while the second is
The problem asks for the number of elements in the smallest subset of that contains both and . The smallest set that contains two sets is simply their union, written . Therefore we need to calculate the cardinality (number of elements) of .
To find we use the Principle of Inclusion-Exclusion, which states
Here is the number of multiples of in , is the number of multiples of in , and is the number of numbers that are multiples of both and , that is, multiples of the least common multiple .
We evaluate each term separately.
Counting |A|: A number is in exactly when it is of the form with . Dividing the inequality by gives , so there are such integers. Hence .
Counting |B|: A number is in exactly when it is of the form with . Dividing by yields (since but ). Thus .
Counting |A∩B|: A number lies in the intersection precisely when it is simultaneously a multiple of and of , meaning it is a multiple of . Write such a number as with . Dividing by gives (since is allowed but ). Therefore .
Now we substitute these counts into the inclusion-exclusion formula:
This number is the size of the smallest subset of that contains every element of both and .
So, the answer is .
Tagged Sets, subsets, power sets and set operations. Machine-assigned, so read it as a strong shortlist rather than a verdict.