2004 AMC 10B Problem 21

Below is the professionally curated solution for Problem 21 of the 2004 AMC 10B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2004 AMC 10B solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:arithmetic sequenceleast common multipleinclusion-exclusion

Difficulty rating: 1740

21.

Let 1,4,1, 4, \ldots and 9,16,9, 16, \ldots be two arithmetic progressions. The set SS is the union of the first 20042004 terms of each sequence. How many distinct numbers are in S?S?

37223722

37323732

39143914

39243924

40074007

Solution:

The first sequence is 1+3k1 + 3k with largest term 6010,6010, and the second is 9+7j9 + 7j with a much larger last term, so the binding limit is 6010.6010.

A common value has the form 16+21m16 + 21m (the first shared term is 16,16, spaced by lcm(3,7)=21\mathrm{lcm}(3, 7) = 21). Requiring 16+21m601016 + 21m \le 6010 gives 0m285,0 \le m \le 285, that is 286286 common numbers.

The number of distinct values is 2004+2004286=3722.2004 + 2004 - 286 = 3722.

Thus, the correct answer is A.

Problem 21 in Other Years