Difference between revisions of "Vieta's formulas"
(Remove vandalism: Undo revision 215808 by Marianasinta (talk)) (Tag: Undo) |
m (→Introductory) |
||
(4 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
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. | 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. | ||
− | It is among the most ubiquitous results to circumvent finding a polynomial's roots in competition math and sees widespread usage in many | + | 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 == | ||
Line 11: | Line 11: | ||
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. | 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 | + | 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>. |
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> | 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> | ||
== Problems == | == Problems == | ||
− | Here are some problems with solutions that utilize Vieta's formulas : | + | Here are some problems with solutions that utilize Vieta's quadratic formulas: |
Line 23: | Line 23: | ||
* [[2007 AMC 12A Problems/Problem 21 | 2007 AMC 12A Problem 21]] | * [[2007 AMC 12A Problems/Problem 21 | 2007 AMC 12A Problem 21]] | ||
* [[2010 AMC 10A Problems/Problem 21 | 2010 AMC 10A Problem 21]] | * [[2010 AMC 10A Problems/Problem 21 | 2010 AMC 10A Problem 21]] | ||
+ | * [[2003 AMC 10A Problems/Problem 18 | 2003 AMC 10A Problem 18]] | ||
=== Intermediate === | === Intermediate === |
Latest revision as of 15:58, 13 July 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 be any polynomial with complex coefficients with roots
, and let
be the
elementary symmetric polynomial of the roots.
Vieta’s formulas then state that
This can be compactly summarized as
for some
such that
.
Proof
Let all terms be defined as above. By the factor theorem, . 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 , each term is generated by a series of
choices of whether to include
or the negative root
from every factor
. Consider all the expanded terms of the polynomial with degree
; they are formed by multiplying a choice of
negative roots, making the remaining
choices in the product
, and finally multiplying by the constant
.
Note that adding together every multiplied choice of negative roots yields
. Thus, when we expand
, the coefficient of
is equal to
. However, we defined the coefficient of
to be
. Thus,
, or
, which completes the proof.
Problems
Here are some problems with solutions that utilize Vieta's quadratic formulas: