Vieta's Formulas & Polynomials

1. Introduction

Vieta's formulas are the bridge between the coefficients of a polynomial and the symmetric functions of its roots. They answer a deceptively powerful question: what can we learn about the roots without ever solving for them? The answer, it turns out, is an enormous amount — sums, products, sums of squares, sums of reciprocals, and far more can all be read off directly from the coefficients.

On the AMC 10/12 and AIME, Vieta's formulas appear constantly, often disguised. A problem might ask for the value of $r_1^3 + r_2^3 + r_3^3$, or for a coefficient given a condition on the roots, or for the product of all roots of a high-degree polynomial that is impossible to factor by hand. In each case, attempting to find the roots explicitly is a trap; the intended path is to translate the question into the language of elementary symmetric polynomials and let Vieta do the work.

This article develops the full machinery: the general statement of Vieta's formulas for any degree, the theory of symmetric polynomials, Newton's identities for power sums, techniques for transforming and constructing polynomials, and a battery of worked contest problems. By the end you should be able to look at almost any "roots and coefficients" problem and immediately know which symmetric quantity to compute.

What you need before starting. Comfort with polynomial division, the factor theorem, and basic symmetric identities ($r_1^2 + r_2^2 = (r_1 + r_2)^2 - 2r_1 r_2$) is assumed. Complex roots are allowed throughout — Vieta's formulas hold over $\mathbb{C}$ without modification. For AIME answers, the final value is always an integer or reduced fraction even when intermediate roots are irrational.

How this article is organized. Section 2 builds fourteen core concepts from the definition through palindromic polynomials. Section 3 collects the formula sheet. Section 4 gives six techniques with micro-examples. Section 5 works eleven contest problems from medium through olympiad level, plus three pipeline guides. Section 6 lists ten common errors. Section 7 separates olympiad tactics from general tips. Section 8 links eight practice problems.

2. Core Concepts

2.1 Statement of Vieta's Formulas

Let $P(x) = a_n x^n + a_{n-1}x^{n-1} + \cdots + a_1 x + a_0$ be a polynomial of degree $n$ with $a_n \neq 0$, and suppose it has roots $r_1, r_2, \ldots, r_n$ (counted with multiplicity, possibly complex). By the Factor Theorem, $P(x) = a_n (x - r_1)(x - r_2)\cdots(x - r_n).$ Expanding the right side and matching coefficients with the left side gives Vieta's formulas. Define the elementary symmetric polynomial $e_k$ as the sum of all products of the roots taken $k$ at a time: $e_1 = \sum_i r_i, \quad e_2 = \sum_{i<j} r_i r_j, \quad e_3 = \sum_{i<j<k} r_i r_j r_k, \quad \ldots, \quad e_n = r_1 r_2 \cdots r_n.$ Then for each $k$ from $1$ to $n$: $e_k = (-1)^k \frac{a_{n-k}}{a_n}.$ The alternating sign is the single most important detail to remember.

2.2 The Quadratic and Cubic Cases

For the quadratic $ax^2 + bx + c = 0$ with roots $r_1, r_2$: $r_1 + r_2 = -\frac{b}{a}, \qquad r_1 r_2 = \frac{c}{a}.$

For the monic cubic $x^3 + px^2 + qx + s = 0$ with roots $r_1, r_2, r_3$: $r_1 + r_2 + r_3 = -p, \qquad r_1 r_2 + r_1 r_3 + r_2 r_3 = q, \qquad r_1 r_2 r_3 = -s.$

For the monic quartic $x^4 + bx^3 + cx^2 + dx + e = 0$ with roots $r_1, r_2, r_3, r_4$: $e_1 = -b, \quad e_2 = c, \quad e_3 = -d, \quad e_4 = e.$

2.3 Symmetric Polynomials and the Fundamental Theorem

A polynomial in $r_1, \ldots, r_n$ is symmetric if it is unchanged under any permutation of the variables. The Fundamental Theorem of Symmetric Polynomials states that every symmetric polynomial can be written uniquely as a polynomial in the elementary symmetric polynomials $e_1, \ldots, e_n$. This is the deep reason Vieta is so useful: any symmetric expression in the roots — which is exactly the kind of thing that can be determined by the coefficients — is expressible through $e_1, \ldots, e_n$, hence through the coefficients.

Examples of the rewriting process (for two variables, write $s = r_1+r_2 = e_1$ and $p = r_1 r_2 = e_2$): $r_1^2 + r_2^2 = s^2 - 2p, \qquad r_1^3 + r_2^3 = s^3 - 3ps, \qquad \frac{1}{r_1} + \frac{1}{r_2} = \frac{s}{p}.$

2.4 Power Sums and Newton's Identities

Define the power sum $p_k = r_1^k + r_2^k + \cdots + r_n^k$. Newton's identities relate the power sums to the elementary symmetric polynomials. For $1 \le k \le n$: $p_k = e_1 p_{k-1} - e_2 p_{k-2} + \cdots + (-1)^{k-1} k\, e_k.$ The first few, which cover most contest needs: $p_1 = e_1,$ $p_2 = e_1 p_1 - 2e_2,$ $p_3 = e_1 p_2 - e_2 p_1 + 3e_3,$ $p_4 = e_1 p_3 - e_2 p_2 + e_3 p_1 - 4e_4.$ For $k > n$ the formula continues without the final $k e_k$ term (since $e_k = 0$): $p_k = e_1 p_{k-1} - e_2 p_{k-2} + \cdots + (-1)^{n-1} e_n p_{k-n}$. This is a clean recursion for high power sums.

2.5 The Root–Coefficient Recurrence

Because each root satisfies the polynomial, $r_i^n = -\frac{a_{n-1}}{a_n} r_i^{n-1} - \cdots - \frac{a_0}{a_n}$. Summing over all roots gives a recursion for $p_k$ directly from the equation, which is often faster than Newton's identities when you only need one specific high power sum. Both viewpoints are worth having.

2.6 Evaluating Products via $P(c)$

If $P(x) = a_n \prod_{i=1}^n (x - r_i)$, then $\prod_{i=1}^n (r_i - c) = (-1)^n P(c), \qquad \prod_{i=1}^n (r_i + c) = (-1)^n P(-c).$ This identity converts products over roots into a single polynomial evaluation. It is often faster than expanding symmetric polynomials when the product has the form $\prod(r_i + c)$ or $\prod(r_i - c)$.

2.7 Polynomial Transformations: Shift, Scale, and Invert

Shift by $t$: If the roots of $P(x)$ are $r_i$, the roots of $P(x - t)$ are $r_i + t$. Read new Vieta quantities from the expanded polynomial.

Scale by $c$: The roots of $P(x/c)$ are $c r_i$. Substitute $x \to cx$ into $P$.

Invert roots: If $r_i \neq 0$ for all $i$, the polynomial whose roots are $1/r_i$ is obtained by reversing the coefficient list (up to a power of $x$). For a monic cubic $x^3 + px^2 + qx + s$, the reciprocal-root polynomial is $sx^3 + qx^2 + px + 1$ (after clearing if needed).

2.8 Constructing Polynomials from Symmetric Data

Given desired values $e_1, e_2, \ldots, e_n$, the monic polynomial with those elementary symmetric polynomials as root data is $x^n - e_1 x^{n-1} + e_2 x^{n-2} - \cdots + (-1)^n e_n.$ This is the reverse of Vieta and is essential when a problem gives conditions on symmetric combinations and asks for the original or a transformed polynomial.

2.9 Discriminant and Root Nature (Quadratic and Beyond)

For $ax^2 + bx + c$, the discriminant $\Delta = b^2 - 4ac$ determines whether roots are real and distinct ($\Delta > 0$), repeated ($\Delta = 0$), or complex ($\Delta < 0$). While Vieta gives symmetric sums regardless of reality, contest problems sometimes combine Vieta with discriminant constraints to pin down coefficients. For cubics, the discriminant is more involved but the principle is the same: symmetric data plus a reality condition narrows the answer.

2.10 Derivatives and Multiple Roots

If $r$ is a root of multiplicity $m \ge 2$, then $P(r) = P'(r) = \cdots = P^{(m-1)}(r) = 0$. Conversely, if $P$ and $P'$ share a common root, that root has multiplicity at least $2$. This links Vieta-style coefficient problems to calculus: a repeated root forces extra symmetric constraints that can determine unknown coefficients.

2.11 Schur-Type Identities for Three Variables

Beyond $r_1^2 + r_2^2 + r_3^2 = e_1^2 - 2e_2$, the following appear constantly on the AIME: $r_1^3 + r_2^3 + r_3^3 = e_1^3 - 3e_1 e_2 + 3e_3,$ $r_1^2 r_2^2 + r_2^2 r_3^2 + r_3^2 r_1^2 = e_2^2 - 2e_1 e_3,$ $(r_1 + r_2)(r_2 + r_3)(r_3 + r_1) = e_1 e_2 - e_3.$ Memorizing a small library of these rewrites saves minutes under time pressure.

2.12 Palindromic and Reciprocal Polynomials

A polynomial is palindromic if its coefficient sequence reads the same forwards and backwards: $a_k = a_{n-k}$. For such polynomials, if $r$ is a root then $1/r$ is also a root (when $r \neq 0$). Dividing by $x^{n/2}$ and substituting $y = x + 1/x$ often reduces even-degree palindromic equations to lower degree — a technique that pairs naturally with Vieta on the reduced variable.

2.13 Interpolation and the Connection to Power Sums

Newton's identities are the bridge between power sums and elementary symmetric polynomials. In olympiad settings, knowing that $p_1, p_2, \ldots, p_n$ determine $e_1, \ldots, e_n$ (and vice versa) means you can work from whichever symmetric data the problem provides. If a problem gives $p_2$ and $p_4$ directly, bootstrap through Newton rather than solving for individual roots.

2.14 Complex Roots and Conjugate Pairs

When coefficients are real, non-real roots come in conjugate pairs. Vieta still holds over $\mathbb{C}$: $e_1, e_2, \ldots$ may be complex, but for real-coefficient polynomials the elementary symmetric polynomials are always real. A common AIME trap: roots look "messy" individually, yet a symmetric target is a clean integer.