PrevNext

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 P(x)P(x) can be written as cnxn+cn−1xn−1+⋯+c1x1+c0x0c_nx^n+c_{n-1}x^{n-1}+\cdots+c_1x^1+c_0x^0.
  • A polynomial P(x)P(x) can be written as C⋅(x−r1)(x−r2)⋯(x−rn)C\cdot (x-r_1)(x-r_2)\cdots(x-r_n).
  • Symmetric expressions can often be rewritten in terms of a symmetric basis.

Core Skills

Key Terms (Introduction!)

For a polynomial PP depending on variables x1,x2,…,xnx_1, x_2, \ldots, x_n, we usually write the polynomial as P(x1,x2,…,xn)P(x_1, x_2, \ldots, x_n).

  • The degree of a polynomial P(x)P(x) is the highest exponent of a polynomial.
  • A root rr of a polynomial P(x)P(x) satisfies P(r)=0P(r) = 0.

Factor Theorem

For a polynomial P(x)P(x) with root rr, then we say P(r)=0P(r) = 0. In particular, there exists a polynomial Q(x)Q(x) such that P(x)=(x−r)⋅Q(x)P(x) = (x-r)\cdot Q(x).

Two ways to interpret a polynomial

Roots. For a polynomial P(x)P(x) with roots r1,r2,…,rnr_1, r_2, \ldots, r_n, we can rewrite

P(x)=C⋅(x−r1)(x−r2)⋯(x−rn)P(x) = C\cdot (x-r_1)(x-r_2)\cdots (x-r_n)

for a constant CC.

Coefficients. For a polynomial P(x)P(x), there exists constants c0,c1,c2,…,cnc_0, c_1, c_2, \ldots, c_n such that

P(x)=cn⋅xn+cn−1⋅xn−1+⋯+c1⋅x1+c0⋅x0.P(x) = c_n\cdot x^n+c_{n-1}\cdot x^{n-1}+\cdots+c_1\cdot x^1 + c_0\cdot x^0.

Symmetric Sums

Definition. (Symmetric Expression) An expression S(x1,x2,…,xn)S(x_1, x_2, \ldots, x_n) is symmetric if for any permutation σ=(σ1,σ2,…,σn)\sigma = (\sigma_1, \sigma_2,\ldots, \sigma_n) of (x1,x2,…,xn)(x_1,x_2, \ldots, x_n) satisfies

S(x1,x2,…,xn)=S(σ1,σ2,…,σn).S(x_1, x_2, \ldots, x_n) = S(\sigma_1, \sigma_2,\ldots, \sigma_n).

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

s1=r1+r2+r3+r4+⋯+rns2=r1r2+r1r3+r1r4+r2r3+r2r4+r3r4+⋯s3=r1r2r3+r1r2r4+r1r3r4+r2r3r4+⋯⋮sn=r1r2r3⋯rn\begin{aligned} s_1 &= r_1 + r_2 + r_3 + r_4 + \cdots + r_n \\ s_2 &= r_1r_2 + r_1r_3 + r_1r_4 + r_2r_3 + r_2r_4 + r_3r_4 + \cdots \\ s_3 &= r_1r_2r_3 + r_1r_2r_4 + r_1r_3r_4 + r_2r_3r_4 + \cdots \\ &\vdots \\ s_n &= r_1r_2r_3 \cdots r_n \end{aligned}

For instance, a2+b2+c2=(a+b+c)2−2(ab+bc+ca)a^2+b^2+c^2=(a+b+c)^2 - 2(ab+bc+ca) and 1a+1b+1c=ab+bc+caabc\dfrac{1}{a}+\dfrac{1}{b}+\dfrac{1}{c} = \dfrac{ab+bc+ca}{abc} are both symmetric expressions.

Worked Example

If rr and ss are roots of x2−5x+6=0x^2-5x+6=0, compute r2+s2r^2+s^2.

We have r+s=5r+s=5 and rs=6rs=6. Then r2+s2=(r+s)2−2rs=25−12=13r^2+s^2=(r+s)^2-2rs=25-12=13.

More Examples (Warmup)

Example 1: Polynomial from Roots

Find the monic polynomial with roots 22 and −3-3.

(x−2)(x+3)=x2+x−6(x-2)(x+3)=x^2+x-6.

Example 2: Reciprocal Sum

If r+s=4r+s=4 and rs=3rs=3, find 1r+1s\frac{1}{r}+\frac{1}{s}.

r+srs=4/3\frac{r+s}{rs}=4/3.

Example 3: Factor Theorem

If p(x)=x3−4x2−x+4p(x)=x^3-4x^2-x+4, show that x=1x=1 is a root and factor p(x)p(x).

p(1)=0p(1)=0, so (x−1)(x-1) is a factor. Then p(x)=(x−1)(x2−3x−4)p(x)=(x-1)(x^2-3x-4).

Example 4: Shifting Roots! (important concept, must remember!)

Let P(x)=x4−8x3+22x2−24x+9P(x)=x^4-8x^3+22x^2-24x+9 have roots r1,r2,r3,r4r_1,r_2,r_3,r_4. We will define si=ri−2s_i=r_i-2. Your job is to find the ∑si5\sum s_i^5.

P(x+2)=x4−2x2+1=(x2−1)2P(x+2)=x^4-2x^2+1=(x^2-1)^2, so the shifted roots are simply 1,1,−1,−11,1,-1,-1. Hence 15+15+(−1)5+(−1)5=01^5+1^5+(-1)^5+(-1)^5=0.

Example 5: Newton Sums (VERY IMPORTANT!)

Let r1,r2,r3,r4r_1,r_2,r_3,r_4 be the roots of x4−3x3+5x2−7x+11=0x^4-3x^3+5x^2-7x+11=0. Your job is to find ∑ri5\sum r_i^5.

We can use Newton sums to get: p1=3p_1=3, p2=−1p_2=-1, p3=3p_3=3, p4=−9p_4=-9, and p5=3p4−5p3+7p2−11p1=−82p_5=3p_4-5p_3+7p_2-11p_1=-82. Thus ∑ri5=−82\sum r_i^5=-82.

Example 6: Generalized Vieta (as a little exercise, prove that generalization!)

Let r1,r2,r3,r4r_1,r_2,r_3,r_4 be the roots of x4+2x3−5x2+7x−3x^4+2x^3-5x^2+7x-3. Your job is to compute ∑i≠jrirj\sum_{i\ne j}\frac{r_i}{r_j}.

∑i≠jrirj=(∑ri)(∑1ri)−4\sum_{i\ne j}\frac{r_i}{r_j}=\left(\sum r_i\right)\left(\sum\frac1{r_i}\right)-4. By Vieta, we have that ∑ri=−2\sum r_i=-2 and ∑1ri=σ3σ4=73\sum \frac1{r_i}=\frac{\sigma_3}{\sigma_4}=\frac73, giving us −263-\frac{26}{3}.

Example 7: A New Polynomial (harder version of example 4)

Let P(x)=x3−6x2+9x−1P(x)=x^3-6x^2+9x-1 have roots r1,r2,r3r_1,r_2,r_3. Your job is to find the polynomial whose roots are ri+1rir_i+\frac1{r_i}.

Let t=r+1rt=r+\frac1r. We can eliminate rr from r2−tr+1=0r^2-tr+1=0 and r3−6r2+9r−1=0r^3-6r^2+9r-1=0 to get t3−15t2+66t−89=0t^3-15t^2+66t-89=0. Thus, the polynomial is x3−15x2+66x−89x^3-15x^2+66x-89.

Example 8: Reciprocal Symmetric Sums (very common!)

Let r1,r2,r3,r4r_1,r_2,r_3,r_4 be the roots of x4−7x3+17x2−17x+6=0x^4-7x^3+17x^2-17x+6=0. Your job is to compute the following: ∑1ri2\sum \frac1{r_i^2}.

By Vieta, ∑1ri=176\sum \frac1{r_i}=\frac{17}{6} and ∑i<j1rirj=176\sum_{i<j}\frac1{r_ir_j}=\frac{17}{6}. Hence, we get: ∑1ri2=(176)2−2(176)=8536\sum \frac1{r_i^2}=\left(\frac{17}{6}\right)^2-2\left(\frac{17}{6}\right)=\frac{85}{36}.

Example 9: Polynomial + Roots of Unity!

Let r1,r2,r3,r4,r5r_1,r_2,r_3,r_4,r_5 be the roots of x5−5x4+10x3−10x2+5x−2=0x^5-5x^4+10x^3-10x^2+5x-2=0. Your job is to find ∑1(ri−1)2\sum \frac1{(r_i-1)^2}.

Since x5−5x4+10x3−10x2+5x−2=(x−1)5−1x^5-5x^4+10x^3-10x^2+5x-2=(x-1)^5-1, we have (ri−1)5=1(r_i-1)^5=1. If we let ζi=ri−1\zeta_i=r_i-1; then 1ζi2=ζi3\frac1{\zeta_i^2}=\zeta_i^3, so the sum simply equals ∑ζi3=0\sum \zeta_i^3=0.

More Examples (Hard):

Strategy Checklist

  • Test small integer roots first.
  • Use Vieta for symmetric expressions.
  • Keep polynomials factored when possible.

Practice Problems

StatusSourceProblem NameDifficultyTags
AIMEHard
Show TagsPolynomials, Vieta
Berkeley Math Circle Monthly Contest 3Hard
Show TagsIrreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein
Berkeley Math Circle: Monthly Contest 6Hard
Show TagsIrreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein
Berkeley Math CircleHard
Show TagsComplex numbers, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Polynomials mod p
Berkeley Math Circle Monthly Contest 1Hard
Show TagsIrreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Polynomial operations
Harvard-MIT Math TournamentHard
Show TagsIrreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Polynomial operations, Polynomials mod p
Bay Area Mathematical OlympiadHard
Show TagsIntermediate Value Theorem, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Prime numbers
Harvard-MIT Mathematics TournamentHard
Show TagsAngle chasing, Cyclic quadrilaterals, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Triangle trigonometry
USAMO 2009Hard
Show TagsFactorization techniques, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Polynomial operations, Techniques: modulo, size analysis, order analysis, inequalities
IMO Team Selection TestHard
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 NovemberHard
Show TagsAngle chasing, Distance chasing, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein
Bay Area Mathematical OlympiadHard
Show TagsAngle chasing, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Triangle trigonometry, Trigonometry
USA TSTSTHard
Show TagsChebyshev polynomials, Greatest common divisors (gcd), Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Triangle trigonometry, Trigonometry
Berkeley Math Circle: Monthly Contest 5Hard
Show TagsComplex numbers, Irreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein, Vieta's formulas
Berkeley Math Circle Take-Home ContestHard
Show TagsInvariants / monovariants, Roots of unity, Sums and products
Berkeley Math Circle Take-Home Contest #1Hard
Show TagsComplex numbers, Roots of unity, Vieta's formulas
Berkeley Math Circle Take-Home Contest #2Hard
Show TagsComplex numbers, Roots of unity
Harvard-MIT Math TournamentHard
Show TagsComplex numbers, Polynomial operations, Roots of unity
USA IMOHard
Show TagsComplex numbers, Enumeration with symmetry, Generating functions, Inclusion-exclusion, Roots of unity
Harvard-MIT Mathematics TournamentHard
Show TagsAlgebraic properties of binomial coefficients, Roots of unity
Harvard-MIT Mathematics TournamentHard
Show TagsComplex numbers, Roots of unity, Vieta's formulas
Harvard-MIT Mathematics TournamentHard
Show TagsComplex numbers, Ring Theory, Roots of unity
Harvard-MIT Mathematics TournamentHard
Show TagsComplex numbers in geometry, Counting two ways, Roots of unity
Harvard-MIT Mathematics TournamentHard
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.

PrevNext