Difference between revisions of "Newton's Sums"
(Replacing the S with the more widely used S) |
(Added more formulas) |
||
| Line 30: | Line 30: | ||
(Define <math>a_j = 0</math> for <math>j<0</math>.) | (Define <math>a_j = 0</math> for <math>j<0</math>.) | ||
| + | |||
| + | We also can write: | ||
| + | |||
| + | <math>P_1 = S_1</math> | ||
| + | |||
| + | <math>P_2 = S_1P_1 - 2S_2</math> | ||
| + | |||
| + | Etc, Where <math>S_n</math> denotes the <math>S^th</math> [[symmetric sum]]. | ||
==Example== | ==Example== | ||
Revision as of 22:00, 27 June 2013
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.
Statement
Consider a polynomial
of degree
,
Let
have roots
. Define the following sums:
Newton sums tell us that,
(Define
for
.)
We also can write:
Etc, Where
denotes the
symmetric sum.
Example
For a more concrete example, consider the polynomial
. Let the roots of
be
and
. Find
and
.
Newton Sums tell us that:
Solving, first for
, and then for the other variables, yields,
Which gives us our desired solutions,
and
.