AMC 10 · 2005 · #22

Grade 6 arithmetic
lcmmultiplesfloor-function identify-subproblemsconvert-to-algebra ↑ Prerequisites: lcmmultiplesfloor-function
📏 Medium solution 💡 2 insights
Problem
S is the list of the 2005 smallest positive multiples of 4, and T is the list of the 2005 smallest positive multiples of 6. Count how many numbers appear in both lists.

Pick an answer.

(A)
166
(B)
333
(C)
500
(D)
668
(E)
1001

AMC 10 2005 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Introduce a Variable

A number shared by both lists must be a multiple of 4 and of 6 at the same time, so it must be a multiple of their least common multiple, 12. Tool #4 names any such shared number 12k, turning "how many common elements" into "how many whole numbers k work." Tool #7 splits the job into two smaller questions — find the biggest number each list reaches — and Tool #14 picks the tighter of the two ceilings, which is the only one that actually limits the count. Then counting the valid k is one division.

1STEP 1

How far each list reaches

Each list ends at its 2005th multiple: S reaches 8020 and T reaches 12030.

max S = 4 × 2005 = 8020, max T = 6 × 2005 = 12030
2STEP 2

A shared number is a multiple of 12

A number in both lists is a multiple of 4 and of 6, hence a multiple of 12 — call it 12k.

lcm(4,6) = 12 → common element = 12k
3STEP 3

Which ceiling actually limits it

Both ceilings must hold, and 8020 is the smaller one, so the binding condition is 12k ≤ 8020.

12k ≤ 8020 and 12k ≤ 12030 → 12k ≤ 8020
4STEP 4

Count the valid multiples

Since k is a whole number and 8020 ÷ 12 = 668.33…, k runs from 1 to 668.

k ≤ 8020/12 = 668.3 → k = 1, 2, …, 668 → 668 values → (D)
Answer
668
There are 668 shared numbers, choice (D). A quick sanity check: the multiples of 12 inside S are every 3rd element of S (since 12 = 4 × 3), and 2005 ÷ 3 ≈ 668, matching. All of these also land in T because T reaches even higher (12030 > 8020). The tempting trap 1001 (E) is roughly 2005/2 — the multiples of 12 inside T — but many of those sit above 8020 and never appear in S, so they should not be counted.
💡Key takeaway

Numbers in both lists must be multiples of the LCM (12), so count the multiples of 12 that fit under the shorter list's ceiling.

  • How far each list reaches
  • A shared number is a multiple of 12
  • Which ceiling actually limits it
  • Count the valid multiples