How many polynomials of degree satisfying are there that have leading coefficient equal to and all of whose coefficients are integers between and , inclusive?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Subtract the two values. The constant cancels, and what remains depends only on the inputs' sum 6 and product 4, forcing c = −32 − 6b.
Solution
1. Write the polynomial. The leading coefficient is , so
where , , are integers from to . Each has possible values before we use the condition.
2. Name the two inputs. Let and . Their sum and product are whole numbers:
Their difference is , which is not zero. The plan is to rewrite the condition using only and , so that the square roots disappear.
3. Subtract the two values. The condition is the same as :
The two 's cancel. So does not matter at all; keep that in mind for the end.
4. Pull out the common factor . Every piece contains a factor of :
(Check the second one by multiplying out: .)
Why this helps: once is pulled out, what is left does not change if you swap and . Expressions like that can always be written using just and , which are plain whole numbers here. So
5. Use the sum and product. Since ,
So
The factor is not zero, so the condition holds exactly when
- Find the allowed . We need between and :
| (too big) | (too small) |
Larger or smaller values of push even further out, so there are exactly good pairs .
7. Bring back . Each good pair works with every one of the values of . So the number of polynomials is
- Check one. Take , , : . Since and , both and are roots of , so . It works.
The answer is .
Why this works
The numbers and have a whole-number sum and product, and any expression that treats them the same way can be written with just that sum and product. Subtracting from and factoring out (using the difference of squares and the difference of cubes) leaves exactly such an expression. The same move works whenever a problem says : subtract, factor out the difference, and see what is left.
Alternative approach
Expand directly and compare the parts.
1. .
2. .
3. So
4. For , every step is the same with in place of :
5. These are equal exactly when the part is zero: . This is the same condition as before, and the count is again .
The trap
Forgetting that the constant term d cancels out and is completely free. Each of the 4 good pairs of b and c works with all 21 values of d, so the count is 4 times 21.
Concise solution
Write and let , , so , and . Then
So the condition is , with unrestricted. The requirement gives , so is one of (with ). With choices of , there are polynomials.
The answer is .
Review in the AoPS books
- Intermediate Algebra, Chapter 6: Polynomial Division (§6.2, §6.4)
- Introduction to Algebra, Chapter 11: Special Factorizations (§11.2, §11.3, §11.5)
- Introduction to Algebra, Chapter 1: Follow the Rules (§1.6, §1.7, §1.8)
- Intermediate Algebra, Chapter 7: Polynomial Roots Part I (§7.1, §7.2, §7.3)
Techniques
Apply an identity: SFFT, sum of squares, difference of cubes, Vieta · Set up the equation/formula and compute; no special trick needed