Overview
Newton's sums are a powerful tool in algebra when trying to evaluate expressions of the form , where , , and are roots of a monic polynomial. Newton's sums can be extended to polynomials of any degree. They allow you to directly evaluate powers of sums without having to undergo heavy algebraic manipulation.
Key Ideas
- For a polynomial , let be the sum of the roots to the power
- From Newton's sums, , , and in general, .
- Newton's sums follow a recursive pattern, so do not forget any previous terms needed to find a following term.
Core Skills
Make the Polynomial Monic
Divide by the leading coefficient so that the Newton sum recurrence applies cleanly.
Build a Recurrence
Use the relation between coefficients and power sums to compute future sums from previous sums .
Combine with Symmetric Identities
Convert into expressions involving and when a direct recurrence is shorter.
Worked Example
Let have roots . Find .
We have , so .
From here, we have , or .
Now, going into our final relation, we have .
Notice that we do not have a term in this relation since we have no other terms left.
Therefore, , which is our answer.
Notice that can be factored as . If it is simpler to directly compute the roots and apply powers to them individually, that would be a faster solution.
However, not all polynomials have roots that can be easily computed, as seen with the next example.
More Examples
Example 1: Irrational Cubic Root Sum
If the cubic polynomial has roots , find .
This polynomial doesn't have a leading coefficient of 1, so we must make it monic.
We first must make the polynomial monic by dividing all coefficients by 5. After doing so, we get the monic cubic .
From here, we have , so .
We can just keep using our recursive relation to find .
, so .
Notice how the sum of the squares of the roots is negative; this indicates we have complex roots, which would be hard to find if we were to manually compute each root.
Finally, we have , so
Example 2: Artificial Polynomial
If two numbers follow and , find .
The sums of powers of two numbers indicate that we can use Newton's sums. However, we aren't given a polynomial; to fix this, we can just make one that obeys the problem statement.
We can create as our polynomial and apply Newton's sums to it.
Setting our given values of equal to the one we just obtained, we have , or . Therefore, .
Strategy Checklist
- Make the polynomial monic first.
- Compute lower powers first before higher powers.
- Avoid arithmetic mistakes; one small accidental sign flip can lead to a sum that is completely off.
Common Pitfalls
- Forgetting to convert to monic form first.
- Skipping earlier power sums needed for the recurrence.
- Lazy arithmetic mistakes.
Practice Problems
| Status | Source | Problem Name | Difficulty | Tags | ||
|---|---|---|---|---|---|---|
| AMC 12A | Hard | Show TagsAlgebra, Newton Sums, Polynomials, Vieta's Formulas | ||||
| AIME II | Medium | Show TagsAlgebra, Newton Sums, Polynomials, Vieta's Formulas | ||||
| AIME II | Medium | Show TagsAlgebra, Newton Sums, Polynomials, Vieta's Formulas | ||||
| Custom | Normal | Show TagsNewton's Sums, Polynomials | ||||
| Custom | Hard | Show TagsNewton's Sums, Symmetric Polynomials | ||||
| Custom | Hard | Show TagsNewton's Sums, Vieta's Formulas | ||||
| Harvard-MIT Math Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange, Polynomial operations | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange, Polynomial operations | ||||
| 10th Annual Harvard-MIT Mathematics Tournament | Hard | Show TagsAlgebraic properties of binomial coefficients, Polynomial interpolation: Newton, Lagrange, Sums and products | ||||
| IMO | Hard | Show TagsDeterminants, Other 3D problems, Polynomial interpolation: Newton, Lagrange, Polynomial operations | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange, Polynomial operations | ||||
| Team Selection Test | Hard | Show TagsChinese remainder theorem, Determinants, Fermat / Euler / Wilson theorems, Polynomial interpolation: Newton, Lagrange, Polynomials mod p | ||||
| Team Selection Test 2009 | Hard | Show TagsAlgebraic properties of binomial coefficients, Greatest common divisors (gcd), Least common multiples (lcm), Polynomial interpolation: Newton, Lagrange | ||||
| Harvard-MIT November Tournament | Hard | Show TagsInduction / smoothing, Polynomial interpolation: Newton, Lagrange | ||||
| Harvard-MIT November Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange | ||||
| Harvard-MIT November Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange | ||||
| 13th Annual Harvard-MIT Mathematics Tournament | Hard | Show TagsIntegers, Polynomial interpolation: Newton, Lagrange | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsIntegers, Other, Polynomial interpolation: Newton, Lagrange | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsModular Arithmetic, Polynomial interpolation: Newton, Lagrange | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange | ||||
| Team Selection Test | Hard | Show TagsAlgebraic properties of binomial coefficients, Counting two ways, Inclusion-exclusion, Polynomial interpolation: Newton, Lagrange, Polynomials mod p, Prime numbers, Recurrence relations | ||||
| 15th Annual Harvard-MIT Mathematics Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange, Quadratic functions | ||||
| Berkeley Math Circle | Hard | Show TagsAlgebraic properties of binomial coefficients, Induction / smoothing, Polynomial interpolation: Newton, Lagrange | ||||
| HMMT November 2014 | Hard | Show TagsComplex numbers, Polynomial interpolation: Newton, Lagrange | ||||
| HMMT 2014 | Hard | Show TagsPolynomial interpolation: Newton, Lagrange, Sums and products | ||||
| Status | Source | Problem Name | Difficulty | Tags | ||
|---|---|---|---|---|---|---|
| AMC 12A | Hard | Show TagsAlgebra, Newton Sums, Polynomials, Vieta's Formulas | ||||
| AIME II | Medium | Show TagsAlgebra, Newton Sums, Polynomials, Vieta's Formulas | ||||
| AIME II | Medium | Show TagsAlgebra, Newton Sums, Polynomials, Vieta's Formulas | ||||
| Custom | Normal | Show TagsNewton's Sums, Polynomials | ||||
| Custom | Hard | Show TagsNewton's Sums, Symmetric Polynomials | ||||
| Custom | Hard | Show TagsNewton's Sums, Vieta's Formulas | ||||
| Harvard-MIT Math Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange, Polynomial operations | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange, Polynomial operations | ||||
| 10th Annual Harvard-MIT Mathematics Tournament | Hard | Show TagsAlgebraic properties of binomial coefficients, Polynomial interpolation: Newton, Lagrange, Sums and products | ||||
| IMO | Hard | Show TagsDeterminants, Other 3D problems, Polynomial interpolation: Newton, Lagrange, Polynomial operations | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange, Polynomial operations | ||||
| Team Selection Test | Hard | Show TagsChinese remainder theorem, Determinants, Fermat / Euler / Wilson theorems, Polynomial interpolation: Newton, Lagrange, Polynomials mod p | ||||
| Team Selection Test 2009 | Hard | Show TagsAlgebraic properties of binomial coefficients, Greatest common divisors (gcd), Least common multiples (lcm), Polynomial interpolation: Newton, Lagrange | ||||
| Harvard-MIT November Tournament | Hard | Show TagsInduction / smoothing, Polynomial interpolation: Newton, Lagrange | ||||
| Harvard-MIT November Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange | ||||
| Harvard-MIT November Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange | ||||
| 13th Annual Harvard-MIT Mathematics Tournament | Hard | Show TagsIntegers, Polynomial interpolation: Newton, Lagrange | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsIntegers, Other, Polynomial interpolation: Newton, Lagrange | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsModular Arithmetic, Polynomial interpolation: Newton, Lagrange | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange | ||||
| Team Selection Test | Hard | Show TagsAlgebraic properties of binomial coefficients, Counting two ways, Inclusion-exclusion, Polynomial interpolation: Newton, Lagrange, Polynomials mod p, Prime numbers, Recurrence relations | ||||
| 15th Annual Harvard-MIT Mathematics Tournament | Hard | Show TagsPolynomial interpolation: Newton, Lagrange, Quadratic functions | ||||
| Berkeley Math Circle | Hard | Show TagsAlgebraic properties of binomial coefficients, Induction / smoothing, Polynomial interpolation: Newton, Lagrange | ||||
| HMMT November 2014 | Hard | Show TagsComplex numbers, Polynomial interpolation: Newton, Lagrange | ||||
| HMMT 2014 | Hard | Show TagsPolynomial interpolation: Newton, Lagrange, Sums and products | ||||
Module Progress:
Join the Discord Community!
Stuck on a problem, or don't understand a module? Join the Discord and get help with your doubts while making more math friends.
