The polynomial has three positive integer roots. What is the smallest possible value of ?
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
The roots multiply to 2010 and add to a. One root must contain the prime 67; split the leftover 30 as evenly as possible, 5 and 6.
Solution
First connect the roots to the numbers and .
1. Roots and coefficients. If the roots are the positive whole numbers , , , the polynomial is . Multiplying out,
Match this with :
- (the sum of the roots),
- (the product of the roots).
2. The new question. Find three positive whole numbers that multiply to with the smallest possible sum.
3. Factor 2010. .
4. The big prime. is prime, so one of the roots must be a multiple of . Keep it as small as possible: make that root exactly . The other two roots multiply to .
5. Split 30. Two numbers with a fixed product have the smallest sum when they are close together. List the options:
| Split of 30 | Sum of all three roots |
|---|---|
- Could a bigger multiple of 67 help? If the root containing were or more, the sum alone would be over , far more than . So no.
- The smallest sum is , from the roots , , .
The answer is .
Why this works
Writing a polynomial as a product of shows that the number in front of is minus the sum of the roots and the constant is minus their product. That turns a polynomial question into a factoring question. To keep a sum small when the product is fixed, make the factors as close to each other as you can; a large prime like decides one factor for you.
The trap
Stopping at a split like 67, 10, 3 (sum 80) instead of the most even split 67, 6, 5 (sum 78).
Concise solution
Let the roots be positive integers . Expanding and matching coefficients (Vieta) gives and . So we want three positive integers with product and the smallest possible sum.
Factor: . The prime must divide one of the roots, so that root is at least . Taking it to be exactly leaves to split between the other two; the sum is smallest when the pair is as balanced as possible:
compared with , , .
Could the root containing be larger? Then it is at least , and the sum exceeds . So the minimum is , attained by roots (and is fine).
The answer is .
Review in the AoPS books
- Intermediate Algebra, Chapter 6: Polynomial Division (§6.2, §6.4)
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Algebra, Chapter 11: Special Factorizations
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.2)
Techniques
Apply an identity: SFFT, sum of squares, difference of cubes, Vieta · Organized listing / direct enumeration