2014 AMC 10A Problems/Problem 24


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

$\textbf{(A)}\ 996,\!506\qquad\textbf{(B)}\ 996,\!507\qquad\textbf{(C)}\ 996,\!508\qquad\textbf{(D)}\ 996,\!509\qquad\textbf{(E)}\ 996,\!510$

Solution 1

If we list the rows by iterations, then we get



$13,14,15,16,17,18$ etc.

so that the $500,000$th number is the $506$th number on the $997$th row because $4+5+6+7......+999 = 499,494$. The last number of the $996$th row (when including the numbers skipped) is $499,494 + (1+2+3+4.....+996)= 996,000$, (we add the $1-996$ because of the numbers we skip) so our answer is $996,000 + 506 = \boxed{\textbf{(A) }996,506}$.

Solution 2

Let's start with natural numbers, with no skips in between.


All we need to do is count how many numbers are skipped, $n$, and "push" (add on to) $500,000$ according to however many numbers are skipped.

Clearly, $\frac{999(1000)}{2}<500,000<\frac{1000(1001)}{2}$. This means that the number of skipped number "blocks" in the sequence is $999-3=996$ because we started counting from 4.

Therefore $n=\frac{996(997)}{2}=496,506$, and the answer is $496,506+500000=\boxed{\textbf{(A) }996,506}$.

Solution 3 (AOPS Video Transcript)

First, we group the numbers together in the following way: ${1, 2, 3, 4, (5)}; {6, 7, 8, 9, 10, (11, 12)}; ...$ We quickly realize that the number of terms in the curly braces follow a pattern: $5, 7, 9, 11, ... , n$ (where $n$ is the $n^\text{th}$ block. Now, we can tell that the last number in a curly brace will be the number of terms in the set added to the number of terms in all the previous sets. Luckily for us, odd numbers are easy to add. If we pretend that there was a $1, 3$ at the beginning, then the sum of all of the numbers before and including $n$ is $(n+2)^2$. However, we have to subtract $1+3$ which results in $n^2+4n$. The amount of numbers in the parenthesis are the $n^\text{th}$ triangular number or $\frac{n(n+1)}{2}$. Next, we want to find the greatest $n$, where $(n^2+4n) - \frac{n(n+1)}{2}<500000$. Simplifying, we get $n^2+7n<1000000$. We realize that $n=1000$ results in a number just $7000$ greater than our target. Next, we square $999$: $(1000 - 1)^2 = 1000000 - 2001$. As we decrease $n$ by $1$, we decrease the result of the equation by approximately $2000$. In order to decrease by at least $7000$, we have to decrease $4$ times leading to $n=1000-4=996$. We plug it in to $n^2+4n$ getting $996\cdot1000=996000$. This is the last number in the $996^\text{th}$ set. The number of terms used is $\frac{n\cdot(n+7)}{2}=\frac{996\cdot1003}{2}=498\cdot1003=498000+1494=499494$. We need to add $500000-499494=506$ terms to get an answer of $\boxed{\textbf{(A) }996,506}$.


Solution 4(Cheap)

We look at each option starting from $A$. Clearly $500000 + n(n+1)/2 = 996506$ where $n$ is the number of the skipped numbers. So we have $n^2 + n - 987012 = 0$. This factors as $(n+997)(n-996)$. Since $n$ is an integer the answer is $A$.


Video Solution by Richard Rusczyk


~ dolphin7

See Also

2014 AMC 10A (ProblemsAnswer KeyResources)
Preceded by
Problem 23
Followed by
Problem 25
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Invalid username
Login to AoPS