AMC 10 · 2019 · #5

Grade 6 arithmetic
sequences-arithmeticsymmetry-argumentpattern-recognitionmean-median-mode-range pattern-recognitionidentify-subproblems ↑ Prerequisites: sequences-arithmetic
📏 Short solution 💡 2 insights
Problem
Find the largest number of consecutive integers (positive, negative, or zero allowed) whose sum is exactly 45.

Pick an answer.

(A)
9
(B)
25
(C)
45
(D)
90
(E)
120

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

How to solve
Strategy Solve an Easier Related Problem

Tool #9 (Easier Problem): try a smaller target sum first, like 'consecutive integers summing to 5'. The trick of including negatives so most terms cancel pops out: -4, -3, …, 4, 5 sums to 5 and has 10 terms. Tool #1 (Diagram): a number line shows the symmetric block from -k to +k summing to 0, with a tail {k+1, …, 45} paying for the 45. Tool #5 (Pattern): once we see the smaller case, generalize — use -44 to 45 for sum 45, giving 90 terms. Tool #3 (Eliminate): the choices climb 9, 25, 45, 90, 120. Anything ≤ 45 ignores negatives. 120 is too long because the symmetric trick caps at 90.

1STEP 1

Warm up: the integers -4, -3, …, 4, 5 sum to 5 because every pair (-k, k) cancels — that is 10 terms, far more than {5} alone.

(-4) + (-3) + (-2) + (-1) + 0 + 1 + 2 + 3 + 4 + 5 = 5, with 10 terms
2STEP 2

Generalize: for a positive target S, the integers -(S-1) up to S sum to S because pairs cancel, giving 2S terms.

Integers -(S-1), -(S-2), …, -1, 0, 1, …, S - 1, S — count = 2S, sum = S
3STEP 3

Apply to S = 45: the integers -44 up to 45 sum to 45, all pairs (-k, k) cancel, and the count is 45 - (-44) + 1 = 90.

Sequence -44, -43, …, 44, 45; count = 45 - (-44) + 1 = 90; sum = 45 → (D)
4STEP 4

Confirm it's maximal: n integers from a give n(2a + n - 1) = 90, so n must divide 90 — and 90 itself is attainable.

n ( 2a + n - 1 ) = 90 → n ∣ 90; largest divisor ≤ 120 is 90, achieved → (D)
5STEP 5

Eliminate the rest: 9 and 45 divide 90 but are smaller; 25 and 120 don't divide 90 at all — so the maximum is 90.

9, 25, 45, 90 ∣ 90 ? 9 ✓, 25 ×, 45 ✓, 90 ✓; 120 × → (D)
Answer
90
Verify directly. The block -44, -43, …, 44, 45 has 90 terms. Pair each negative with its positive: (-44) + 44 = 0, (-43) + 43 = 0, …, (-1) + 1 = 0. That's 44 cancellations leaving 0 and 45. The full sum is 0 + 45 = 45 ✓. So 90 consecutive integers can indeed sum to 45 — the answer (D) is achievable.
💡Key takeaway

This AMC 10 problem only needs Grade 6 "negatives on the number line" you already know — start at -44 and run up to 45 so every pair (-k, k) cancels and only 45 is left, giving 90 terms.