Difference between revisions of "Vieta's Formulas"

(added from http://artofproblemsolving.com/wiki/index.php?title=2008_AIME_II_Problems/Problem_7)
m (Advanced)
 
(63 intermediate revisions by 45 users not shown)
Line 1: Line 1:
'''Vieta's Formulas''', otherwise called Viète's Laws, are a set of [[equation]]s relating the [[root]]s and the [[coefficient]]s of [[polynomial]]s.
+
In [[algebra]], '''Vieta's formulas''' are a set of results that relate the coefficients of a [[polynomial]] to its roots. In particular, it states that the [[elementary symmetric polynomial | elementary symmetric polynomials]] of its roots can be easily expressed as a ratio between two of the polynomial's coefficients.
  
== Introduction ==
+
It is among the most ubiquitous results to circumvent finding a polynomial's roots in competition math and sees widespread usage in many math contests/tournaments.
  
Vieta's Formulas were discovered by the French mathematician [[François Viète]].
+
== Statement ==
 +
Let <math>P(x) = a_n x^n + a_{n-1}x^{n-1} + \cdots + a_1 x + a_0</math> be any polynomial with [[Complex number | complex]] coefficients with roots <math>r_1, r_2, \ldots , r_n</math>, and let <math>s_j</math> be the <math>j^{\text{th}}</math> elementary symmetric polynomial of the roots.  
  
Vieta's Formulas can be used to relate the sum and product of the roots of a polynomial to its coefficients. The simplest application of this is with quadratics. If we have a quadratic <math>x^2+ax+b=0</math> with solutions <math>p</math> and <math>q</math>, then we know that we can factor it as
+
Vieta’s formulas then state that <cmath>s_1 = r_1 + r_2 + \cdots + r_n = - \frac{a_{n-1}}{a_n}</cmath> <cmath>s_2 = r_1r_2 + r_2r_3 + \cdots + r_{n-1}r_n = \frac{a_{n-2}}{a_n}</cmath> <cmath>\vdots</cmath> <cmath>s_n = r_1r_2r_3 \cdots r_n = (-1)^n \frac{a_0}{a_n}.</cmath> This can be compactly summarized as <math>s_j = (-1)^j \frac{a_{n-j}}{a_n}</math> for some <math>j</math> such that <math>1 \leq j \leq n</math>.
  
<center><math>x^2+ax+b=(x-p)(x-q)</math></center>
+
== Proof ==
 +
Let all terms be defined as above. By the [[factor theorem]], <math>P(x) = a_n (x-r_1)(x-r_2) \cdots (x-r_n)</math>. We will then prove Vieta’s formulas by expanding this polynomial and comparing the resulting coefficients with the original polynomial’s coefficients.
  
(Note that the first term is <math>x^2</math>, not <math>ax^2</math>.) Using the distributive property to expand the right side we get
+
When expanding the factorization of <math>P(x)</math>, each term is generated by a series of <math>n</math> choices of whether to include <math>x</math> or the negative root <math>-r_{i}</math> from every factor <math>(x-r_{i})</math>. Consider all the expanded terms of the polynomial with degree <math>n-j</math>; they are formed by multiplying a choice of <math>j</math> negative roots, making the remaining <math>n-j</math> choices in the product <math>x</math>, and finally multiplying by the constant <math>a_n</math>.
  
<center><math>x^2+ax+b=x^2-(p+q)x+pq</math></center>  
+
Note that adding together every multiplied choice of <math>j</math> negative roots yields <math>(-1)^j s_j</math>. Thus, when we expand <math>P(x)</math>, the coefficient of <math>x_{n-j}</math> is equal to <math>(-1)^j a_n s_j</math>. However, we defined the coefficient of <math>x^{n-j}</math> to be <math>a_{n-j}</math>. Thus, <math>(-1)^j a_n s_j = a_{n-j}</math>, or <math>s_j = (-1)^j a_{n-j}/a_n</math>, which completes the proof. <math>\square</math>
  
We know that two polynomials are equal if and only if their coefficients are equal, so <math>x^2+ax+b=x^2-(p+q)x+pq</math> means that <math>a=-(p+q)</math> and <math>b=pq</math>. In other words, the product of the roots is equal to the constant term, and the sum of the roots is the opposite of the coefficient of the <math>x</math> term.
+
== Problems ==
 +
Here are some problems with solutions that utilize Vieta's quadratic formulas:
  
A similar set of relations for cubics can be found by expanding <math>x^3+ax^2+bx+c=(x-p)(x-q)(x-r)</math>.
 
  
We can state Vieta's formula's more rigorously and generally. Let <math>P(x)</math> be a polynomial of degree <math>n</math>, so <math>P(x)={a_n}x^n+{a_{n-1}}x^{n-1}+\cdots+{a_1}x+a_0</math>,
+
=== Introductory ===
where the coefficient of <math>x^{i}</math> is <math>{a}_i</math> and <math>a_n \neq 0</math>. As a consequence of the [[Fundamental Theorem of Algebra]], we can also write <math>P(x)=a_n(x-r_1)(x-r_2)\cdots(x-r_n)</math>, where <math>{r}_i</math> are the roots of <math>P(x)</math>.  We thus have that
+
* [[2005 AMC 12B Problems/Problem 12 | 2005 AMC 12B Problem 12]]
 +
* [[2007 AMC 12A Problems/Problem 21 | 2007 AMC 12A Problem 21]]
 +
* [[2010 AMC 10A Problems/Problem 21 | 2010 AMC 10A Problem 21]]
 +
* [[2003 AMC 10A Problems/Problem 18 | 2003 AMC 10A Problem 18]]
 +
* [[2021 AMC 12A Problems/Problem 12 | 2021 AMC 12A Problem 12]]
  
<center><math> a_nx^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0 = a_n(x-r_1)(x-r_2)\cdots(x-r_n).</math></center>
+
=== Intermediate ===
 +
* [[2017 AMC 12A Problems/Problem 23 | 2017 AMC 12A Problem 23]]
 +
* [[2003 AIME II Problems/Problem 9 | 2003 AIME II Problem 9]]
 +
* [[2008 AIME II Problems/Problem 7 | 2008 AIME II Problem 7]]
 +
* [[2021 Fall AMC 12A Problems/Problem 23 | 2021 Fall AMC 12A Problem 23]]
 +
* [[2019 AIME I Problems/Problem 10 | 2019 AIME I Problem 10]]
  
Expanding out the right hand side gives us
+
==Advanced==
 +
* [[2020 AIME I Problems/Problem 14 | 2020 AIME I Problem 14]]
  
<math> a_nx^n - a_n(r_1+r_2+\!\cdots\!+r_n)x^{n-1} + a_n(r_1r_2 + r_1r_3 +\! \cdots\! + r_{n-1}r_n)x^{n-2} +\! \cdots\! + (-1)^na_n r_1r_2\cdots r_n.</math>
+
== See also ==
 +
* [[Polynomial]]
  
The coefficient of <math> x^k </math> in this expression will be the <math>k </math>th [[symmetric sum]] of the <math>r_i</math>. 
+
[[Category:Algebra]]
 
+
[[Category:Polynomials]]
We now have two different expressions for <math>P(x)</math>.  These must be equal.  However, the only way for two polynomials to be equal for all values of <math>x</math> is for each of their corresponding coefficients to be equal.  So, starting with the coefficient of <math> x^n </math>, we see that
+
[[Category:Theorems]]
 
 
<center><math>a_n = a_n</math></center>
 
<center><math> a_{n-1} = -a_n(r_1+r_2+\cdots+r_n)</math></center>
 
<center><math> a_{n-2} = a_n(r_1r_2+r_1r_3+\cdots+r_{n-1}r_n)</math></center>
 
<center><math>\vdots</math></center>
 
<center><math>a_0 = (-1)^n a_n r_1r_2\cdots r_n</math></center>
 
 
 
More commonly, these are written with the roots on one side and the <math>a_i</math> on the other (this can be arrived at by dividing both sides of all the equations by <math>a_n</math>).
 
 
 
If we denote <math>\sigma_k</math> as the <math>k</math>th symmetric sum, then we can write those formulas more compactly as <math>\sigma_k = (-1)^k\cdot \frac{a_{n-k}}{a_n{}}</math>, for <math>1\le k\le {n}</math>.
 
 
 
==Problems==
 
 
 
*Let <math>r_1,r_2,</math> and <math>r_3</math> be the three roots of the cubic <math>x^3 + 3x^2 + 4x - 4</math>.  Find the value of <math>r_1r_2+r_1r_3+r_2r_3</math>.
 
*Suppose the polynomial <math>5x^3 + 4x^2 - 8x + 6</math> has three real roots <math>a,b</math>, and <math>c</math>.  Find the value of <math>a(1+b+c)+b(1+a+c)+c(1+a+b)</math>.
 
*Let <math>m</math> and <math>n</math> be the roots of the quadratic equation <math>4x^2 + 5x + 3 = 0</math>. Find <math>(m + 7)(n + 7)</math>.
 
 
 
===Intermediate===
 
*Let <math>a</math>, <math>b</math>, and <math>c</math> be positive real numbers with <math>a<b<c</math> such that <math>a+b+c=12</math>, <math>a^2+b^2+c^2=50</math>, and <math>a^3+b^3+c^3=216</math>. Find <math>a+2b+3c</math>.
 
*(USAMTS 2010) Find <math>c>0</math> such that if <math>r</math>, <math>s</math>, and <math>t</math> are the roots of the cubic <cmath>f(x)=x^3-4x^2+6x-c,</cmath> then <cmath>1=\dfrac1{r^2+s^2}+\dfrac1{s^2+t^2}+\dfrac1{t^2+r^2}.</cmath>
 
*(HMMT 2007) The complex numbers <math>\alpha_1</math>, <math>\alpha_2</math>, <math>\alpha_3</math>, and <math>\alpha_4</math> are the four distinct roots of the equation <math>x^4+2x^3+2=0</math>.  Determine the unordered set <cmath>\{\alpha_1\alpha_2+\alpha_3\alpha_4,\,\alpha_1\alpha_3+\alpha_2\alpha_4,\,\alpha_1\alpha_4+\alpha_2\alpha_3\}.</cmath>
 
 
 
===Olympiad===
 
[2008 AIME II] Let <math>r</math>, <math>s</math>, and <math>t</math> be the three roots of the equation <math>8x^3 + 1001x + 2008 = 0</math>. Find <math>(r + s)^3 + (s + t)^3 + (t + r)^3</math>.
 
 
 
== See Also ==
 
 
 
* [[Algebra]]
 
* [[Polynomials]]
 
* [[Newton's Sums]]
 
 
 
== External Links ==
 
*[http://mathworld.wolfram.com/VietasFormulas.html Mathworld's Article]
 
 
 
[[Category:Elementary algebra]]
 

Latest revision as of 14:21, 24 June 2025

In algebra, Vieta's formulas are a set of results that relate the coefficients of a polynomial to its roots. In particular, it states that the elementary symmetric polynomials of its roots can be easily expressed as a ratio between two of the polynomial's coefficients.

It is among the most ubiquitous results to circumvent finding a polynomial's roots in competition math and sees widespread usage in many math contests/tournaments.

Statement

Let $P(x) = a_n x^n + a_{n-1}x^{n-1} + \cdots + a_1 x + a_0$ be any polynomial with complex coefficients with roots $r_1, r_2, \ldots , r_n$, and let $s_j$ be the $j^{\text{th}}$ elementary symmetric polynomial of the roots.

Vieta’s formulas then state that \[s_1 = r_1 + r_2 + \cdots + r_n = - \frac{a_{n-1}}{a_n}\] \[s_2 = r_1r_2 + r_2r_3 + \cdots + r_{n-1}r_n = \frac{a_{n-2}}{a_n}\] \[\vdots\] \[s_n = r_1r_2r_3 \cdots r_n = (-1)^n \frac{a_0}{a_n}.\] This can be compactly summarized as $s_j = (-1)^j \frac{a_{n-j}}{a_n}$ for some $j$ such that $1 \leq j \leq n$.

Proof

Let all terms be defined as above. By the factor theorem, $P(x) = a_n (x-r_1)(x-r_2) \cdots (x-r_n)$. We will then prove Vieta’s formulas by expanding this polynomial and comparing the resulting coefficients with the original polynomial’s coefficients.

When expanding the factorization of $P(x)$, each term is generated by a series of $n$ choices of whether to include $x$ or the negative root $-r_{i}$ from every factor $(x-r_{i})$. Consider all the expanded terms of the polynomial with degree $n-j$; they are formed by multiplying a choice of $j$ negative roots, making the remaining $n-j$ choices in the product $x$, and finally multiplying by the constant $a_n$.

Note that adding together every multiplied choice of $j$ negative roots yields $(-1)^j s_j$. Thus, when we expand $P(x)$, the coefficient of $x_{n-j}$ is equal to $(-1)^j a_n s_j$. However, we defined the coefficient of $x^{n-j}$ to be $a_{n-j}$. Thus, $(-1)^j a_n s_j = a_{n-j}$, or $s_j = (-1)^j a_{n-j}/a_n$, which completes the proof. $\square$

Problems

Here are some problems with solutions that utilize Vieta's quadratic formulas:


Introductory

Intermediate

Advanced

See also