AMC 10 Step by Step

2024 AMC 10B Problem 5

P1-10~3 minPrint

In the following expression, Melanie changed some of the plus signs to minus signs: 1+3+5+7+...+97+991+3+5+7+...+97+99 When the new expression was evaluated, it was negative. What is the least number of plus signs that Melanie could have changed to minus signs?

Log in to save your progress.
Show solution without answering

Key insight

The full sum is 2500. Flipping a plus to a minus takes away twice that number, so the flipped numbers must add up to more than 1250.

Solution

1. First find the total with all plus signs. Sums of odd numbers starting at 11 make perfect squares: 1=11 = 1, 1+3=41 + 3 = 4, 1+3+5=91 + 3 + 5 = 9. There are 5050 odd numbers from 11 to 9999, so the total is 502=250050^2 = 2500.
2. See what one sign change does. If 9999 becomes −99-99, the total loses 9999 (it is no longer added) and loses another 9999 (it is now subtracted). So the total drops by 2⋅992 \cdot 99.
3. So if the numbers Melanie flips add up to SS, the new total is 2500−2S2500 - 2S. This is negative exactly when 2S>25002S > 2500, that is, when S>1250S > 1250.
4. To pass 12501250 with as few numbers as possible, flip the biggest ones: 99,97,95,…99, 97, 95, \ldots
5. Add up the 1414 biggest, 9999 down to 7373. They pair up as 99+73=17299 + 73 = 172, 97+75=17297 + 75 = 172, and so on, giving 77 pairs:
7⋅172=1204.7 \cdot 172 = 1204.
This is less than 12501250, so 1414 flips are not enough.
6. Add the next one, 7171: 1204+71=12751204 + 71 = 1275, which is more than 12501250. So 1515 flips work.

Since even the 1414 biggest numbers fall short, no set of 1414 or fewer can work, and 1515 is the least.

The answer is (B) 15\boxed{\textbf{(B)}\ 15}.

Why this works

Changing a plus to a minus takes away twice that number, so "make the total negative" becomes "the flipped numbers must add up to more than half the total." To use as few flips as possible, always take the biggest numbers first. If the biggest 1414 cannot reach the target, no other 1414 can either.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

There are 5050 odd numbers from 11 to 9999, and their sum is 502=250050^2 = 2500.

Changing the sign of a term tt lowers the total by 2t2t. If the flipped terms have sum SS, the new value is 2500−2S2500 - 2S, which is negative exactly when S>1250S > 1250.

To reach S>1250S > 1250 with as few terms as possible, flip the largest terms. The kk largest odd numbers are 99,97,…,101−2k99, 97, \dots, 101 - 2k, an arithmetic series with average 100−k100 - k, so their sum is k(100−k)k(100 - k).

  • k=14k = 14: 14⋅86=1204<125014 \cdot 86 = 1204 < 1250, not enough.
  • k=15k = 15: 15⋅85=1275>125015 \cdot 85 = 1275 > 1250, works.

The answer is (B) 15\boxed{\textbf{(B)}\ 15}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site. Also appeared as 2024 12B #5.