AMC 10 · 2024 · #5

Grade 6 algebra
sequences-arithmeticperfect-squaressystematic-enumeration convert-to-algebrabound-inequality-then-enumeratesystematic-enumeration ↑ Prerequisites: sequences-arithmeticlinear-equations-one-var
📏 Medium solution 💡 3 insights
Problem
Start with the expression 1 + 3 + 5 + … + 97 + 99 (the sum of the first 50 positive odd integers). Melanie flips some of the + signs to - signs so that the new value is negative. What is the smallest number of sign flips that can achieve this?

Pick an answer.

(A)
14
(B)
15
(C)
16
(D)
17
(E)
18

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

How to solve
Strategy Convert to Algebra

Tool #13 (Convert to Algebra) turns the verbal "flip plus to minus" rule into clean arithmetic: each flip of x subtracts 2x from the original total S = 2500, so the new sum is S - 2 · (sum of flipped terms) and we need this < 0, i.e. the flipped terms must sum to more than 1250. Tool #16 (Change Focus) is the strategic insight that lets us minimize the count — instead of asking "how many flips?", ask "what's the maximum reduction per flip?" and you get the greedy choice 99, 97, 95, …. Tool #6 (Guess and Check) finishes by testing the two adjacent candidate values k = 14 and k = 15 in the closed-form sum.

1STEP 1

The first 50 odd numbers sum to 50² = 2500 — pair them as 1 + 99 = 100 for 25 hundreds to confirm.

S = 1 + 3 + 5 + … + 99 = 50² = 2500
2STEP 2

Flipping +x to -x lowers the total by 2x, so if the flipped numbers add to F the new sum is 2500 - 2F.

S_new = 2500 - 2F, F = Σ_flipped x
3STEP 3

The "new sum negative" condition, 2500 - 2F < 0, rearranges to F > 1250.

2500 - 2F < 0 ⟺ F > 1250
4STEP 4

To spend flips efficiently, flip the largest odds first; the k biggest sum to k(100 - k).

max sum with k flips = 99 + 97 + … + (101 - 2k) = k(100 - k)
5STEP 5

Test the boundary: 14 · 86 = 1204 falls short, but 15 · 85 = 1275 clears 1250 — so (B).

k = 14: 14 · 86 = 1204 ≯ 1250 (fails) k = 15: 15 · 85 = 1275 > 1250 (works) → (B)
Answer
15
Verify the k = 15 flip explicitly. Flipping the top 15 odd numbers 71, 73, …, 99 pulls them off the positive side and adds them on the negative side, costing 2 · 1275 = 2550. The new sum is 2500 - 2550 = -50 < 0, so 15 flips really do produce a negative total. With k = 14, even the most efficient flips (73, 75, …, 99) sum to 1204, giving 2500 - 2408 = 92 > 0, so 14 flips cannot do it. The minimum is exactly 15, matching (B).
💡Key takeaway

This AMC 10 problem only needs Grade 6 inequalities (turn "new sum negative" into F > 1250) plus Grade 5 multi-digit multiplication — flip the biggest odd numbers first and you cross the line at flip 15!