Skip to main content

2002 AMC 12B Problem 21

Problem 21 of 25HarderNumber Theory

For all positive integers nn less than 2002,2002, let an={11,if n is divisible by 13 and 14;13,if n is divisible by 14 and 11;14,if n is divisible by 11 and 13;0,otherwise.a_n=\begin{cases} 11, & \text{if } n \text{ is divisible by } 13 \text{ and } 14;\\ 13, & \text{if } n \text{ is divisible by } 14 \text{ and } 11;\\ 14, & \text{if } n \text{ is divisible by } 11 \text{ and } 13;\\ 0, & \text{otherwise}. \end{cases} Calculate n=12001an.\displaystyle\sum_{n=1}^{2001} a_n.

Answer choices

Show solution

Solution

Since 2002=1113142002=11\cdot13\cdot14 with 11,11, 13,13, 1414 pairwise coprime, an=11a_n=11 when nn is divisible by 182,182, an=13a_n=13 when nn is divisible by 154,154, and an=14a_n=14 when nn is divisible by 143143 (and no n<2002n\lt2002 is divisible by all three). For n2001n\le2001 there are 1010 multiples of 182,182, 1212 of 154,154, and 1313 of 143.143. So the sum is 1110+1312+1413=110+156+182=448. \begin{gathered} 11\cdot10+13\cdot12+14\cdot13 \\ {}=110+156+182 \\ {}=448. \end{gathered} Thus, the correct answer is A.

More practice

Concepts: divisibility · least common multiple · multiple

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.