Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "Vieta's formulas"

(Removed redirect to Vieta's Formulas)
(Tag: Removed redirect)
(→‎Introductory)
 
(32 intermediate revisions by 14 users not shown)
Line 1: Line 1:
−
In [[algebra]], '''Vieta's formulas''' are a set of formulas that relate the coefficients of a [[polynomial]] to its roots.
+
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.
  
−
(WIP)
+
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 ==
 
== 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_n</math> be the [[elementary symmetric polynomial]] of the roots with degree <math>n</math>. Vietas 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_1r_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 written as if <math>j</math> is any integer such that <math>0<j<n</math>, then <math>s_j = (-1)^j \frac{a_{n-j}}{a_n}</math>.
+
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 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>.
 +
 
 
== Proof ==
 
== Proof ==
−
By the [[factor theorem]], <math>P(x) = a_n (x-r_1)(x-r_2) \cdots (x-r_n)</math>; we will then prove these formulas by expanding this polynomial. Let <math>j</math> be any integer such that <math>0<j<n</math>. We wish to find a process that generates every term with degree <math>j</math>. If
+
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.
  
 +
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>a_n = a_n</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>
−
<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>).
+
== Problems ==
 +
Here are some problems with solutions that utilize Vieta's quadratic formulas:
  
−
If we denote <math>\sigma_k</math> as the <math>k</math>-th elementary 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>.
 
−
Also, <math>-b/a = p + q, c/a = p \cdot q</math>.
 
  
−
Provide links to problems that use vieta formulas:
+
=== Introductory ===
−
Examples:
+
* [[2005 AMC 12B Problems/Problem 12 | 2005 AMC 12B Problem 12]]
−
https://artofproblemsolving.com/wiki/index.php/2017_AMC_12A_Problems/Problem_23
+
* [[2007 AMC 12A Problems/Problem 21 | 2007 AMC 12A Problem 21]]
−
https://artofproblemsolving.com/wiki/index.php/2010_AMC_10A_Problems/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]]
  
−
==Proving Vieta's Formula==
+
=== Intermediate ===
−
Basic proof:
+
* [[2017 AMC 12A Problems/Problem 23 | 2017 AMC 12A Problem 23]]
−
This has already been proved earlier, but I will explain it more.
+
* [[2003 AIME II Problems/Problem 9 | 2003 AIME II Problem 9]]
−
If we have
+
* [[2008 AIME II Problems/Problem 7 | 2008 AIME II Problem 7]]
−
<math>x^2+ax+b=(x-p)(x-q)</math>, the roots are <math>p</math> and <math>q</math>.
+
* [[2021 Fall AMC 12A Problems/Problem 23 | 2021 Fall AMC 12A Problem 23]]
−
Now expanding the left side, we get: <math>x^2+ax+b=x^2-qx-px+pq</math>.
 
−
Factor out an <math>x</math> on the right hand side and we get: <math>x^2+ax+b=x^2-x(p+q)+pq</math>
 
−
Looking at the two sides, we can quickly see that the coefficient <math>a</math> is equal to <math>-(p+q)</math>. <math>p+q</math> is the actual sum of roots, however. Therefore, it makes sense that <math>p+q= \frac{-b}{a}</math>. The same proof can be given for <math>pq=\frac{c}{a}</math>.
 
  
−
Note: If you do not understand why we must divide by <math>a</math>, try rewriting the original equation as <math>ax^2+bx+c=(x-p)(x-q)</math>
+
== See also ==
 +
* [[Polynomial]]
  
 
[[Category:Algebra]]
 
[[Category:Algebra]]
 
[[Category:Polynomials]]
 
[[Category:Polynomials]]
 
[[Category:Theorems]]
 
[[Category:Theorems]]

Latest revision as of 20:24, 21 October 2024

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

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Vieta%27s_formulas&oldid=230302"