Consider the following sets of elements each: \begin{align} &\{1,2,3,\ldots,10\}, \\ &\{11,12,13,\ldots,20\},\\ &\{21,22,23,\ldots,30\},\\ &\vdots\\ &\{991,992,993,\ldots,1000\}. \end{align} How many of these sets contain exactly two multiples of ?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Every block of 10 holds one or two multiples of 7; with 142 multiples spread over 100 blocks, the number of two-multiple blocks is 142 − 100 = 42.
Solution
Ten consecutive integers always include a multiple of (any seven consecutive integers do), and never three of them (that would need a span of at least ). So every set contains exactly one or exactly two multiples of .
The total number of multiples of from to is .
Let sets contain two multiples and contain one. Counting multiples of two ways,
The answer is .
Why this works
Instead of inspecting each block, bound what a block can contain (here, or ) and then use a global total. This "count the same thing two ways" step turns a messy positional question into one linear equation. The bound is the whole trick: once each block has one or two, the total pins down how many have two.
Alternative approach
Multiples of repeat every numbers, which is blocks. In – the multiples are ; blocks (), () and () hold two, so exactly of every blocks contain two multiples. Fourteen full cycles cover numbers ( blocks) and give ; the last two blocks (–) contain and , one each. Total .
The trap
Trying to track the position of the multiples of 7 block by block, or assuming every block has at least one multiple of 7 only after checking a few.
Common mistakes
- Trying to track the position of the multiples of 7 block by block, or assuming every block has at least one multiple of 7 only after checking a few.
- Computing correctly but then "adjusting" for the final block, or answering the number of one-multiple blocks ().
Techniques
Bound the quantity above/below or estimate to pin it down · Set up the equation/formula and compute; no special trick needed