Polynomial Roots
For a monic polynomial with roots : , , and .
In plain terms. The coefficients ARE the symmetric combinations of the roots (with signs). So you can get sums and products of roots straight from the polynomial.
Example. For : the roots sum to , sum in pairs to , and multiply to — they are .
Why it works. A monic polynomial with roots IS the product . Expanding, the term collects once from each factor, the term collects every product of two roots, and the constant is the product of all the . Matching coefficients is the whole theorem, which is also how to rebuild the signs if you forget them: they alternate, starting with minus.
The remainder of divided by is ; so is a factor exactly when .
In plain terms. To find the remainder or test a factor, just plug the number in — no long division needed.
Example. has , so is a factor; indeed .
Why it works. Division gives with a constant, because the remainder has lower degree than . Put : the first term vanishes and . Dividing by a quadratic leaves a LINEAR remainder , and two evaluations pin down its two unknowns.
Symmetric expressions reduce to and : and .
In plain terms. You rarely need the actual roots — rewrite the expression using only their sum and product, which Vieta hands you.
Example. If then , so .
The roots of are , , . Find .
Spotting it. A product of the form is the polynomial itself, evaluated at . No expansion into symmetric sums is needed.
Step 1. , so .
Step 2. , so .
Check by Vieta: the product expands to ✓
When is divided by the remainder is , and when it is divided by the remainder is . What is the remainder when is divided by ?
Spotting it. The divisor is a quadratic, so the remainder is linear: . The remainder theorem gives and , which is exactly two equations.
Step 1. : . : .
Step 2. Subtract: , then . The remainder is .
Find the remainder when is divided by .
Spotting it. Long division is out of the question. The divisor factors as , so evaluate at its two roots.
Step 1. Write .
Step 2. : . : .
Step 3. So , , and the remainder is .
Sign slips in Vieta for a cubic. For the product of the roots is , not : in the product is . And in the first worked example, evaluating at instead of gives , the product of , which is a different question.
Find the sum of the squares of the roots of .
Show the answerHide the answer
By Vieta, and , so . Check: the polynomial factors as , and ✓
Vieta, Symmetric Sums and Clever Factoring
For : , . For : , , .
Vieta answers questions about the roots without finding them, which is the point: for , with no factoring at all. The identities worth knowing cold are and for a cubic.
: add the missing constant and factor.
It turns a two-variable equation into a divisor problem. becomes , and the integer solutions come from the divisor pairs of . The signal is a product term plus linear terms in the same equation — the missing constant is always the product of the two linear coefficients.
The roots of are . Find and .
Step 1 — Vieta: , , .
Step 2 — .
Step 3 — . Check: the roots are , and , ✓
How many ordered pairs of positive integers satisfy ?
Spotting it. Clearing denominators gives a product term and two linear terms, : the signal for Simon's trick.
Step 1. Add to both sides: .
Step 2. Both factors must be positive. If both were negative, then and would make their product at most .
Step 3. So is any positive divisor of , and is the complementary divisor. There are divisors, hence 9 ordered pairs, from to .
If and are the roots of , find .
Spotting it. is symmetric, so it is a polynomial in and .
Step 1. , so .
Step 2. . The roots themselves are , and nothing in the computation needed them.
Accepting every factor pair. In the SFFT Try-it, also has the pair , but it gives , which is not positive. Write down the range each factor must lie in (, ) BEFORE listing pairs, and remember negative pairs too when the variables are only required to be integers.
How many positive integer pairs satisfy ?
Show the answerHide the answer
Add : . With , we need and , so the factor pairs work — five pairs.
Symmetric Systems: Solve for the Sum and Product
If a system is unchanged by swapping and , rewrite it in and using and . Then and are the two roots of , and they are real exactly when .
Why it works. Every symmetric polynomial in and can be written in terms of and alone, so a symmetric system in becomes a system in , usually of lower degree. Going back is Vieta: numbers with sum and product are the roots of . The discriminant is a square of a real number, which is why it must be non-negative when and are real.
Solve , .
Spotting it. Swapping and changes nothing, so switch to and ; is given.
Step 1. gives , so .
Step 2. and are the roots of : the solutions are and .
Check: ✓
Real numbers and satisfy and . Find every possible value of .
Spotting it. Both equations are symmetric. In and they read and (since ): a sum and a product again, so and are themselves the roots of a quadratic.
Step 1. , so .
Step 2. Case , : the reality test fails, since . No real , come from this case.
Step 3. Case , : real, since . Then , and this is the only possible value. (The numbers are .)
Skipping the reality test. From and the formula gives , which is impossible for real numbers. The system has no real solution because ; the -quadratic has complex roots. Whenever a case produces and , check before using it.
If and , find .
Show the answerHide the answer
, so . Check: are and , and ✓