2024 AMC 10A Problem 7
The product of three integers is . What is the least possible positive sum of the three integers?
Show solution without answering
Key insight
The word is integers, so negatives are allowed. Two negative numbers keep the product positive but make the sum small: (−1)(−6)(10) = 60 with sum 3.
Solution
The problem says "integers", not "positive integers", so negative numbers are allowed. That matters a lot.
- Which signs are possible? The product is positive. So either all three numbers are positive, or exactly two are negative. (One or three negatives would make the product negative.)
- All positive. Numbers that multiply to and add to something small should be close together, like , which add to . Every choice from to is much smaller than that, so positive numbers are no good.
- Two negatives. Write the numbers as , and , where , , are positive, , and the sum is . We want big and just a little smaller than .
- Try some values of . For each that divides , the product must be . Here are the useful cases:
| possible | sum | ||
|---|---|---|---|
| or | or | ||
| or | or | ||
| or | or | ||
- For or smaller, is at least , so is at least and the sum is negative.
- The smallest positive sum in the table is , from , , : indeed and . No row gives or .
The answer is .
Why this works
Read the word "integers" carefully: it lets two of the numbers be negative, which keeps the product positive while cancelling most of the sum. After you find a small sum, the answer choices tell you exactly which smaller values you must rule out, and a short table of the ways to split does that.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Since the product is positive, either all three integers are positive or exactly two are negative.
All positive: the sum is at least (three factors of cannot all be close to any better than this), far above the small choices.
Two negatives: write the integers as with , , and sum . The sum is achievable: , , gives , i.e. with sum .
Since is an answer choice, check it: we would need with . Run through the divisors of large enough to matter: : , need (actual or ); : , need (actual or ); : , need (actual ); : , need (actual or ); : , need (actual ). For we would need while . So sum is impossible (and sum fails the same way).
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.2)
- Introduction to Number Theory, Chapter 5: Divisor Problems (§5.2, §5.3)
- Introduction to Algebra, Chapter 20: Special Functions (§20.3)
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.