Difference between revisions of "Newton's Sums"
m (fixed a typo (seveal --> several)) |
Quantum leap (talk | contribs) m |
||
Line 11: | Line 11: | ||
<math>\displaystyle S_1 = x_1 + x_2 + \cdots + x_n</math> | <math>\displaystyle S_1 = x_1 + x_2 + \cdots + x_n</math> | ||
− | <math>\displaystyle S_2 = x_1^2 + x_2^2 + \cdots + x_n</math> | + | <math>\displaystyle S_2 = x_1^2 + x_2^2 + \cdots + x_n^2</math> |
<math>\vdots</math> | <math>\vdots</math> |
Revision as of 16:01, 29 June 2006
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.
Basic Usage
Consider a polynomial:
Let have roots . Define the following sums:
Newton sums tell us that,
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, -127 and 1.