Difference between revisions of "Newton's Sums"
(→Statement) |
m (→Practice) |
||
(14 intermediate revisions by 10 users not shown) | |||
Line 17: | Line 17: | ||
<cmath>a_nP_3 + a_{n-1}P_2 + a_{n-2}P_1 + 3a_{n-3}=0</cmath> | <cmath>a_nP_3 + a_{n-1}P_2 + a_{n-2}P_1 + 3a_{n-3}=0</cmath> | ||
<cmath>\vdots</cmath> | <cmath>\vdots</cmath> | ||
+ | <cmath>\boxed{a_nP_k+a_{n-1}P_{k-1}+\cdots+a_{n-k+1}P_1+k\cdot a_{n-k}=0}</cmath> | ||
+ | (Define <math>a_j = 0</math> for <math>j<0</math>.) | ||
− | |||
We also can write: | We also can write: | ||
Line 24: | Line 25: | ||
<cmath>P_1 = S_1</cmath> | <cmath>P_1 = S_1</cmath> | ||
<cmath>P_2 = S_1P_1 - 2S_2</cmath> | <cmath>P_2 = S_1P_1 - 2S_2</cmath> | ||
+ | <cmath>P_3 = S_1P_2 - S_2P_1 + 3S_3</cmath> | ||
+ | <cmath>P_4 = S_1P_3 - S_2P_2 + S_3P_1 - 4S_4</cmath> | ||
+ | <cmath>P_5 = S_1P_4 - S_2P_3 + S_3P_2 - S_4P_1 + 5S_5</cmath> | ||
+ | <cmath>\vdots</cmath> | ||
− | + | where <math>S_n</math> denotes the <math>n</math>-th [[elementary symmetric sum]]. | |
==Proof== | ==Proof== | ||
Line 58: | Line 63: | ||
− | <cmath> | + | <cmath>a_nP_k+a_{n-1}P_{k-1}+a_{n-2}P_{k-2}+...+a_0P_{k-n}=0.</cmath> |
+ | |||
+ | *Note (Warning!): This technically only proves the statements for the cases where <math>k \geq n</math>. For the cases where <math>k < n</math>, an argument based on analyzing individual monomials in the expansion can be used (see http://web.stanford.edu/~marykw/classes/CS250_W19/Netwons_Identities.pdf, for example.) | ||
==Example== | ==Example== | ||
Line 89: | Line 96: | ||
==Practice== | ==Practice== | ||
[https://artofproblemsolving.com/wiki/index.php/2019_AMC_12A_Problems/Problem_17 2019 AMC 12A Problem 17] | [https://artofproblemsolving.com/wiki/index.php/2019_AMC_12A_Problems/Problem_17 2019 AMC 12A Problem 17] | ||
+ | |||
+ | [https://artofproblemsolving.com/wiki/index.php/2003_AIME_II_Problems/Problem_9 2003 AIME II Problem 9] | ||
+ | |||
+ | [https://artofproblemsolving.com/wiki/index.php/2008_AIME_II_Problems/Problem_7 2008 AIME II Problem 7] | ||
+ | |||
+ | [https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_13#Solution_2 2024 AIME II Problem 13] | ||
==See Also== | ==See Also== | ||
*[[Vieta's formulas]] | *[[Vieta's formulas]] | ||
− | |||
*[[Newton's Inequality]] | *[[Newton's Inequality]] | ||
+ | [[Category:Algebra]] | ||
[[Category:Polynomials]] | [[Category:Polynomials]] | ||
[[Category:Theorems]] | [[Category:Theorems]] |
Latest revision as of 07:28, 24 November 2024
Newton sums give us a clever and efficient way of finding the sums of roots of a polynomial raised to a power. They can also be used to derive several factoring identities.
Contents
[hide]Statement
Consider a polynomial of degree ,
Let have roots . Define the sum:
Newton's sums tell us that,
(Define for .)
We also can write:
where denotes the -th elementary symmetric sum.
Proof
Let be the roots of a given polynomial . Then, we have that
Thus,
Multiplying each equation by , respectively,
Sum,
Therefore,
- Note (Warning!): This technically only proves the statements for the cases where . For the cases where , an argument based on analyzing individual monomials in the expansion can be used (see http://web.stanford.edu/~marykw/classes/CS250_W19/Netwons_Identities.pdf, for example.)
Example
For a more concrete example, consider the polynomial . Let the roots of be and . Find and .
Newton's Sums tell us that:
Solving, first for , and then for the other variables, yields,
Which gives us our desired solutions, and .