Overview
Polynomials appear often at AIME level. Learn how to relate roots and coefficients and how to build polynomials with given roots.
Key Ideas
- A polynomial can be written as .
- A polynomial can be written as .
- Symmetric expressions can often be rewritten in terms of a symmetric basis.
Core Skills
Key Terms (Introduction!)
For a polynomial depending on variables , we usually write the polynomial as .
- The degree of a polynomial is the highest exponent of a polynomial.
- A root of a polynomial satisfies .
Factor Theorem
For a polynomial with root , then we say . In particular, there exists a polynomial such that .
Two ways to interpret a polynomial
Roots. For a polynomial with roots , we can rewrite
for a constant .
Coefficients. For a polynomial , there exists constants such that
Symmetric Sums
Definition. (Symmetric Expression) An expression is symmetric if for any permutation of satisfies
In general, any symmetric expression can be written in terms of a symmetric basis. The symmetric basis, in particular, is the expressions that actually occur directly due to Vieta's Theorem. The basis, in particular, is
For instance, and are both symmetric expressions.
Worked Example
If and are roots of , compute .
We have and . Then .
More Examples (Warmup)
Example 1: Polynomial from Roots
Find the monic polynomial with roots and .
.
Example 2: Reciprocal Sum
If and , find .
.
Example 3: Factor Theorem
If , show that is a root and factor .
, so is a factor. Then .
Example 4: Shifting Roots! (important concept, must remember!)
Let have roots . We will define . Your job is to find the .
, so the shifted roots are simply . Hence .
Example 5: Newton Sums (VERY IMPORTANT!)
Let be the roots of . Your job is to find .
We can use Newton sums to get: , , , , and . Thus .
Example 6: Generalized Vieta (as a little exercise, prove that generalization!)
Let be the roots of . Your job is to compute .
. By Vieta, we have that and , giving us .
Example 7: A New Polynomial (harder version of example 4)
Let have roots . Your job is to find the polynomial whose roots are .
Let . We can eliminate from and to get . Thus, the polynomial is .
Example 8: Reciprocal Symmetric Sums (very common!)
Let be the roots of . Your job is to compute the following: .
By Vieta, and . Hence, we get: .
Example 9: Polynomial + Roots of Unity!
Let be the roots of . Your job is to find .
Since , we have . If we let ; then , so the sum simply equals .
More Examples (Hard):
Strategy Checklist
- Test small integer roots first.
- Use Vieta for symmetric expressions.
- Keep polynomials factored when possible.
Practice Problems
| Status | Source | Problem Name | Difficulty | Tags | ||
|---|---|---|---|---|---|---|
| AIME | Hard | Show TagsPolynomials, Vieta | ||||
| Berkeley Math Circle Monthly Contest 3 | Hard | Show TagsIrreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein | ||||
| Berkeley Math Circle: Monthly Contest 6 | Hard | Show TagsIrreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein | ||||
| Berkeley Math Circle | Hard | Show TagsComplex numbers, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Polynomials mod p | ||||
| Berkeley Math Circle Monthly Contest 1 | Hard | Show TagsIrreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Polynomial operations | ||||
| Harvard-MIT Math Tournament | Hard | Show TagsIrreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Polynomial operations, Polynomials mod p | ||||
| Bay Area Mathematical Olympiad | Hard | Show TagsIntermediate Value Theorem, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Prime numbers | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsAngle chasing, Cyclic quadrilaterals, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Triangle trigonometry | ||||
| USAMO 2009 | Hard | Show TagsFactorization techniques, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Polynomial operations, Techniques: modulo, size analysis, order analysis, inequalities | ||||
| IMO Team Selection Test | Hard | Show TagsGroup Theory, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Polynomials mod p, Primitive roots mod p / p^n, Roots of unity, Vieta's formulas | ||||
| HMMT November | Hard | Show TagsAngle chasing, Distance chasing, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein | ||||
| Bay Area Mathematical Olympiad | Hard | Show TagsAngle chasing, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Triangle trigonometry, Trigonometry | ||||
| USA TSTST | Hard | Show TagsChebyshev polynomials, Greatest common divisors (gcd), Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Triangle trigonometry, Trigonometry | ||||
| Berkeley Math Circle: Monthly Contest 5 | Hard | Show TagsComplex numbers, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Vieta's formulas | ||||
| Berkeley Math Circle Take-Home Contest | Hard | Show TagsInvariants / monovariants, Roots of unity, Sums and products | ||||
| Berkeley Math Circle Take-Home Contest #1 | Hard | Show TagsComplex numbers, Roots of unity, Vieta's formulas | ||||
| Berkeley Math Circle Take-Home Contest #2 | Hard | Show TagsComplex numbers, Roots of unity | ||||
| Harvard-MIT Math Tournament | Hard | Show TagsComplex numbers, Polynomial operations, Roots of unity | ||||
| USA IMO | Hard | Show TagsComplex numbers, Enumeration with symmetry, Generating functions, Inclusion-exclusion, Roots of unity | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsAlgebraic properties of binomial coefficients, Roots of unity | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsComplex numbers, Roots of unity, Vieta's formulas | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsComplex numbers, Ring Theory, Roots of unity | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsComplex numbers in geometry, Counting two ways, Roots of unity | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsComplex numbers, Polynomial operations, Roots of unity | ||||
Module Progress:
Join the Discord Community!
Stuck on a problem, or don't understand a module? Join the Discord and get help with your doubts while making more math friends.
