AMC 10 · 2003 · #1

Grade 3 arithmetic
sequences-arithmeticparitypattern-recognition identify-subproblemspattern-recognition ↑ Prerequisites: sequences-arithmetic
📏 Short solution 💡 1 insight
📘 View easy version →
Problem
Take the sum of the first 2003 even counting numbers and subtract the sum of the first 2003 odd counting numbers. Report the difference.

Pick an answer.

(A)
0
(B)
1
(C)
2
(D)
2003
(E)
4006

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

How to solve
Strategy Look for a Pattern

Adding two lists of 2003 numbers and subtracting is huge and error-prone. Tool #5 (Look for a Pattern) spots that the two lists run in lockstep: 2 sits right after 1, 4 right after 3, and so on. So instead of two giant sums, pair the lists position by position and look at one pair at a time. Tool #7 (Identify Subproblems) turns the whole thing into 2003 tiny subtractions, each of which is the same. Tool #3 (Eliminate Possibilities) then checks the size of the answer against the choices.

1STEP 1

Pair the two lists position by position

Line the lists up and subtract position by position: (even sum) - (odd sum) = (2-1)+(4-3)+…+(4006-4005).

(2-1)+(4-3)+(6-5)+…+(4006-4005)
2STEP 2

Every pair differs by exactly 1

Every matched pair gives the same gap of 1: 2-1=1, 4-3=1, …, 4006-4005=1.

2-1=1, 4-3=1, 6-5=1, …, 4006-4005=1
3STEP 3

Add up the 2003 ones

The difference is 2003 copies of 1, so 2003 × 1 = 2003, which is choice (D).

1+1+…+1₂₀₀₃ ones=2003 × 1 = 2003 → (D)
Answer
2003
The even list is bigger than the odd list, so the difference must be positive — that kills (A) 0. Each matched pair differs by 1, not 2, so the total gap is one per pair, not two; that rules out (E) 4006, which is what you would get if each pair differed by 2. With 2003 pairs each contributing 1, the difference is 2003, matching (D).
💡Key takeaway

Instead of adding two long lists and subtracting, pair them up: each even number is just 1 past its odd partner, so 2003 pairs give a difference of 2003.

  • Pair the two lists position by position
  • Every pair differs by exactly 1
  • Add up the 2003 ones