Difference between revisions of "Newton's Sums"
Archimedes1 (talk | contribs) m (→Basic Usage) |
Archimedes1 (talk | contribs) m (→Basic Usage) |
||
Line 5: | Line 5: | ||
Consider a polynomial <math>\displaystyle P(x)</math> of degree <math>n</math>, | Consider a polynomial <math>\displaystyle P(x)</math> of degree <math>n</math>, | ||
− | <center><math>\displaystyle | + | <center><math>\displaystyle P(x) = a_nx^n + a_{n-1}x^{n-1} + \cdots + a_1x + a_0</math></center> |
− | Let <math>P(x)=0</math> have roots <math>x_1,x_2,\ldots,x_n</math>. Define the following sums: | + | Let <math>\displaystyle P(x)=0</math> have roots <math>x_1,x_2,\ldots,x_n</math>. Define the following sums: |
<math>\displaystyle S_1 = x_1 + x_2 + \cdots + x_n</math> | <math>\displaystyle S_1 = x_1 + x_2 + \cdots + x_n</math> |
Revision as of 19:56, 2 July 2007
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 of degree ,
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, and .