Difference between revisions of "Newton's Sums"
Archimedes1 (talk | contribs) m (→Basic Usage) |
Archimedes1 (talk | contribs) m (Newton sums moved to Newton's sums: AoPS Volume II calls them Newton's Sums, and it makes sense because they are the Sums of Newton.) |
(No difference)
|
Revision as of 12:17, 3 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
,
![$\displaystyle P(x) = a_nx^n + a_{n-1}x^{n-1} + \cdots + a_1x + a_0$](http://latex.artofproblemsolving.com/0/4/8/048f3d9f71b9de5006ba1da753b7631c32eff33b.png)
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
.