Polynomials
Degree > 2: factor/remainder theorem, Vieta for higher degree, polynomial division, roots
PolynomialsAMC 10 Step by Step
Name: Date: October 28, 2026
Algebra · 11 problems have this as their main idea
11
primary-topic problems (0.8% of all)
7
more as a secondary topic
Where it appears
2
P1-10
2
P11-15
1
P16-20
6
P21-25
What you need to know
- Remainder Theorem. Dividing a polynomial by leaves the remainder . Example: divided by leaves .
- Factor Theorem. is a factor of exactly when . Example: for , , so is a factor.
- The remainder has a lower degree than what you divide by. So dividing by leaves a number, and dividing by a quadratic leaves a remainder like . Example: write , where is the quotient. Plugging in and gives and , so the remainder is .
- Vieta's Formulas for a cubic. If has roots , , , then , , and . The signs go minus, plus, minus. Example: has roots , and , , .
- If the leading coefficient is not , divide every coefficient by it first. Example: the roots of add to and multiply to .
- is the sum of the coefficients, and is the constant term. Example: for , and .
- Rational Root Theorem. If a polynomial has integer coefficients and a fraction in lowest terms is a root, then divides the constant term and divides the leading coefficient. Example: has roots , , ; each top divides and each bottom divides .
- Counting roots. A polynomial of degree has exactly roots, counting each repeated root as often as it repeats (its multiplicity) and including non-real roots. With real coefficients, non-real roots come in pairs and (conjugates), where . Example: has roots , and has roots .
How AMC 10 tests it
- Problems 8–15: the remainder when is divided by , , or . Write (quotient , divisor , remainder ) and plug in the roots of .
- Problems 12–18: a cubic with integer or given roots, asking for a coefficient or the sum of the squares of the roots.
- "": build , which has the known roots , then evaluate it somewhere else.
- Problems 18–23: polynomials with integer coefficients, using the fact that divides for different integers and .
Standard approaches
- Ask whether you need the roots at all. If swapping two roots doesn't change the question, use Vieta's Formulas directly.
- For remainders, write and plug in the roots of , which make zero.
- When is described by its values, build a helper polynomial with known roots, such as . Example: if is a cubic with leading coefficient and , then , so .
- To find integer roots, test the divisors of the constant term, positive and negative. Divide out each root found (synthetic division).
Worked example
The polynomial has three integer roots (not necessarily distinct), one of which is . What is the sum of all possible values of ?
(A) (B) (C) (D) (E)
Call the other two roots and . By Vieta's Formulas the roots multiply to , so and . The integer pairs with product are and .
Vieta's Formulas also say is the sum of the products of pairs of roots:
If the roots are , then and . If they are , then and .
Both cases happen: and .
The sum is . The answer is .
Pitfalls
- Sign slips in Vieta's Formulas for a cubic: the roots of multiply to , not .
- Forgetting to divide by a leading coefficient that is not : the roots of add to , not .
- Assuming the remainder on division by a quadratic is a number. It can be : leaves remainder .
- Forgetting repeated or non-real roots when counting: has three roots but only two different ones.
Traps that recur
- Trying to find the roots or the individual constants A, B, C numerically instead of expressing 1/A + 1/B + 1/C symmetrically and using Vieta. (2019 AMC 10A #24)
- Stopping at the lower bound and forgetting to confirm that an integer polynomial Q actually exists for a = 315, or using the product 15915*105 instead of the lcm. (2010 AMC 10B #25)
- Trying a quadratic P first and not recognizing the contradiction, or expanding P and forgetting the constant term 3 when summing squares. (2022 AMC 10B #21)
- Trying to find the roots of g, or solving for b and c by full expansion and making an arithmetic slip; f(1) = g(1)(1 - r) needs only a and r. (2017 AMC 10A #24)
Problems, easiest first
Open any of them to try it here; the worked solution is on the problem's own page.