Let be a polynomial with rational coefficients such that when is divided by the polynomial , the remainder is , and when is divided by the polynomial , the remainder is . There is a unique polynomial of least degree with these two properties. What is the sum of the squares of the coefficients of that polynomial?
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
For the remainder on dividing by x² + 1, replace x² by −1. For x² + x + 1, replace x² by −x − 1 and x³ by 1.
Solution
A shortcut for remainders. Since , every is " plus a multiple of ". So to find the remainder after dividing by , you may replace by (and so by ).
For the same idea says replace by . Also is a multiple of , so replace by .
1. Try a cubic. Two remainder conditions, each with two numbers to match, give four equations, so a polynomial with four coefficients is the natural first guess:
2. Divide by . Replace by and by :
This must be , so and .
3. Divide by . Replace by and by :
This must be , so and .
4. Solve. From and we get . Then , , and .
5. Nothing smaller works. A polynomial of degree or less is the case . But step 4 showed must be , so no smaller polynomial fits. The least-degree polynomial is
6. Check. Replace by : . Replace by and by : . Both match.
7. Sum of squares. .
The answer is .
Why this works
The remainder only cares about what is left after taking away multiples of the divisor, so you can swap (or ) for something simpler that differs from it by such a multiple. This turns each remainder condition into two plain equations. Two conditions give four equations, which is why a polynomial with four coefficients, a cubic, is the smallest that can satisfy both.
Alternative approach
Build from the second condition. Any with remainder after dividing by has the form for a cubic. Multiplying out gives . Now replace by and by : the remainder is . Matching gives and , so again .
The trap
Assuming a quadratic is enough without checking, or forgetting the constant term 3 when adding up the squares of the coefficients.
Concise solution
cannot have degree , since then both remainders would equal itself, but .
The second condition says . Try the smallest .
If is constant, . Modulo we may replace by : . The constant term can never match the required , so no quadratic works.
Let :
Modulo use and :
Matching with : gives , then gives .
So , and the sum of the squares of its coefficients is .
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)
- Intermediate Algebra, Chapter 20: Some Advanced Strategies (§20.2)
- Intermediate Algebra, Chapter 7: Polynomial Roots Part I (§7.1, §7.2, §7.3)
Techniques
Set up the equation/formula and compute; no special trick needed · Substitute to simplify (u = x+1/x, shifting, scaling)