Let be the set of the smallest positive multiples of , and let be the set of the smallest positive multiples of . How many elements are common to and ?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Common elements are multiples of 12, and the binding constraint is the smaller set: S tops out at 8020, so count multiples of 12 up to 8020.
Solution
A number lies in both sets only if it is a multiple of both and , i.e. a multiple of .
Now find how far each set reaches. ends at ; ends at . Every multiple of up to is a multiple of below 's cap and a multiple of below 's cap, so it is in both sets; multiples of beyond are missing from .
So the common elements are the multiples of up to :
Equivalently, every third element of ( with ) is a multiple of , and .
The answer is .
Why this works
"The smallest multiples of " is the interval , so intersecting two such sets means intersecting two intervals of multiples; the shorter interval decides the count. Translate "first " into an explicit upper bound before counting, then count multiples of the lcm below that bound.
The trap
Counting multiples of 12 up to 12030 (the top of T) to get 1002, or using 2005/6 = 334 from the wrong ratio.
Common mistakes
- Counting multiples of 12 up to 12030 (the top of T) to get 1002, or using 2005/6 = 334 from the wrong ratio.
- Dividing by to get (choice (A) is nearby), as if the sets contained the integers to .
Techniques
Bound the quantity above/below or estimate to pin it down