The product of three integers is . What is the least possible positive sum of the three integers?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Allow two negative factors: (−1)(−6)(10) = 60 has sum 3, and checking the factor triples shows a positive sum of 1 or 2 is impossible.
Solution
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 .
Why this works
"Integers" (not "positive integers") is the whole point: two negative factors keep the product positive while cancelling most of the sum. Once a small sum is found, the answer choices tell you exactly which smaller values must be ruled out, and a short scan of factor triples does it.
The trap
Assuming all three integers are positive (best sum 3+4+5 = 12, not even a choice), or accepting 3 without ruling out the smaller choice 2.
Common mistakes
- Assuming all three integers are positive (best sum 3+4+5 = 12, not even a choice), or accepting 3 without ruling out the smaller choice 2.
- Reporting a negative sum such as ; the problem asks for the least positive sum.
Techniques
Use the answer choices (mod checks, size, form) to eliminate or select · Organized listing / direct enumeration