Skip to main content

2014 AMC 10A Problem 24

Problem 24 of 25HarderAlgebraNumber Theory

A sequence of natural numbers is constructed by listing the first 4,4, then skipping one, listing the next 5,5, skipping 2,2, listing 6,6, skipping 3,3, and on the nnth iteration, listing n+3n+3 and skipping n.n. The sequence begins 1,2,3,4,6,7,8,9,10,13.1,2,3,4,6,7,8,9,10,13. What is the 500,000500{,}000th number in the sequence?

Answer choices

Show solution

Solution

After nn full iterations, the number of listed terms is 4+5+⋯+(n+3)=n(n+7)24+5+\cdots+(n+3)=\frac{n(n+7)}2. We need the largest nn with n(n+7)2<500000\frac{n(n+7)}2<500000. Since 996⋅1003=998988996\cdot1003=998988, after 996996 iterations there are 499494499494 listed numbers. The first number listed in iteration 997997 is one more than the total of all listed and skipped numbers so far, namely 9962+4⋅996+1=996001996^2+4\cdot996+1=996001. The 500000500000th listed number is the 500000−499494=506500000-499494=506th number of this next block, so it is 996001+505=996506996001+505=996506. Thus, A is the correct answer.
AoPS wiki

Tagged: arithmetic sequence · summation · triangular number

More practice