Overview

Newton's sums are a powerful tool in algebra when trying to evaluate expressions of the form rn+sn+tn+⋯r^n + s^n + t^n + \cdots, where rr, ss, and tt 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 xn+a1xn−1+a2xn−2+⋯+anx^n + a_1x^{n-1} + a_2x^{n-2} + \cdots+ a_n, let SnS_n be the sum of the roots to the nthnth power
  • From Newton's sums, S1+a1=0S_1 + a_1 = 0, S2+a1S1+2a2=0S_2 + a_1S_1 + 2a_2 = 0, and in general, Sn+a1Sn−1+a2Sn−2+⋯+nan=0S_n + a_1S_{n-1} + a_2S_{n-2} + \cdots + na_n = 0.
  • 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 Sn,Sn+1S_n, S_{n+1} from previous sums Sn−2,Sn−1S_{n-2}, S_{n-1}.

Combine with Symmetric Identities

Convert rk+skr^k+s^k into expressions involving r+sr+s and rsrs when a direct recurrence is shorter.

Worked Example

Let x2−5x+6=0x^2-5x+6=0 have roots r,sr,s. Find r3+s3r^3+s^3.

We have S1−5=0S_1 - 5 = 0, so S1=5S_1 = 5.

From here, we have S2−5S1+12=0S_2 - 5S_1 + 12 = 0, or S2=5(5)−12=13S_2 = 5(5)-12 = 13.

Now, going into our final relation, we have S3−5S2+6S1=0S_3 - 5S_2 + 6S_1 = 0.

Notice that we do not have a nanna_n term in this relation since we have no other terms left.

Therefore, S3=5(13)−6(5)=35S_3 = 5(13)-6(5) = 35, which is our answer.

Notice that x2−5x+6=0x^2-5x+6=0 can be factored as (x−3)(x−2)(x-3)(x-2). 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 5x3−4x2+3x+2=05x^3 - 4x^2 + 3x + 2 = 0 has roots r,s,tr, s, t, find r3+s3+t3r^3 + s^3 + t^3.

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 x3−45x2+35x+25x^3 - \frac{4}{5}x^2+\frac{3}{5}x + \frac{2}{5}.

From here, we have S1−45=0S_1 - \frac{4}{5} = 0, so S1=45S_1 = \frac{4}{5}.

We can just keep using our recursive relation to find S3S_3.

S2=45S1−65S_2 = \frac{4}{5}S_1-\frac{6}{5}, so S2=−1425S_2 = \frac{-14}{25}.

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 S3−45S2+35S1+65=0S_3-\frac{4}{5}S_2+\frac{3}{5}S_1+\frac{6}{5}=0, so S3=−9825S_3 = \frac{-98}{25}

Example 2: Artificial Polynomial

If two numbers x,yx,y follow x+y=6x+y=6 and x3+y3=100x^3+y^3=100, find xyxy.

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 x2−6x+ax^2-6x+a as our polynomial and apply Newton's sums to it.

S2−6S1+2a=0,S2=36−2aS_2 - 6S_1 + 2a = 0, S_2 = 36-2a

S3−6S2+aS1=0,S3=216−18aS_3-6S_2+aS_1=0, S_3 = 216-18a

Setting our given values of S3S_3 equal to the one we just obtained, we have 216−18a=100216-18a=100, or a=58/9a = 58/9. Therefore, xy=58/9xy = 58/9.

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

StatusSourceProblem NameDifficultyTags
AMC 12AHard
Show TagsAlgebra, Newton Sums, Polynomials, Vieta's Formulas
AIME IIMedium
Show TagsAlgebra, Newton Sums, Polynomials, Vieta's Formulas
AIME IIMedium
Show TagsAlgebra, Newton Sums, Polynomials, Vieta's Formulas
CustomNormal
Show TagsNewton's Sums, Polynomials
CustomHard
Show TagsNewton's Sums, Symmetric Polynomials
CustomHard
Show TagsNewton's Sums, Vieta's Formulas
Harvard-MIT Math TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange, Polynomial operations
Harvard-MIT Mathematics TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange, Polynomial operations
10th Annual Harvard-MIT Mathematics TournamentHard
Show TagsAlgebraic properties of binomial coefficients, Polynomial interpolation: Newton, Lagrange, Sums and products
IMOHard
Show TagsDeterminants, Other 3D problems, Polynomial interpolation: Newton, Lagrange, Polynomial operations
Harvard-MIT Mathematics TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange, Polynomial operations
Team Selection TestHard
Show TagsChinese remainder theorem, Determinants, Fermat / Euler / Wilson theorems, Polynomial interpolation: Newton, Lagrange, Polynomials mod p
Team Selection Test 2009Hard
Show TagsAlgebraic properties of binomial coefficients, Greatest common divisors (gcd), Least common multiples (lcm), Polynomial interpolation: Newton, Lagrange
Harvard-MIT November TournamentHard
Show TagsInduction / smoothing, Polynomial interpolation: Newton, Lagrange
Harvard-MIT November TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange
Harvard-MIT November TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange
13th Annual Harvard-MIT Mathematics TournamentHard
Show TagsIntegers, Polynomial interpolation: Newton, Lagrange
Harvard-MIT Mathematics TournamentHard
Show TagsIntegers, Other, Polynomial interpolation: Newton, Lagrange
Harvard-MIT Mathematics TournamentHard
Show TagsModular Arithmetic, Polynomial interpolation: Newton, Lagrange
Harvard-MIT Mathematics TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange
Team Selection TestHard
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 TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange, Quadratic functions
Berkeley Math CircleHard
Show TagsAlgebraic properties of binomial coefficients, Induction / smoothing, Polynomial interpolation: Newton, Lagrange
HMMT November 2014Hard
Show TagsComplex numbers, Polynomial interpolation: Newton, Lagrange
HMMT 2014Hard
Show TagsPolynomial interpolation: Newton, Lagrange, Sums and products
StatusSourceProblem NameDifficultyTags
AMC 12AHard
Show TagsAlgebra, Newton Sums, Polynomials, Vieta's Formulas
AIME IIMedium
Show TagsAlgebra, Newton Sums, Polynomials, Vieta's Formulas
AIME IIMedium
Show TagsAlgebra, Newton Sums, Polynomials, Vieta's Formulas
CustomNormal
Show TagsNewton's Sums, Polynomials
CustomHard
Show TagsNewton's Sums, Symmetric Polynomials
CustomHard
Show TagsNewton's Sums, Vieta's Formulas
Harvard-MIT Math TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange, Polynomial operations
Harvard-MIT Mathematics TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange, Polynomial operations
10th Annual Harvard-MIT Mathematics TournamentHard
Show TagsAlgebraic properties of binomial coefficients, Polynomial interpolation: Newton, Lagrange, Sums and products
IMOHard
Show TagsDeterminants, Other 3D problems, Polynomial interpolation: Newton, Lagrange, Polynomial operations
Harvard-MIT Mathematics TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange, Polynomial operations
Team Selection TestHard
Show TagsChinese remainder theorem, Determinants, Fermat / Euler / Wilson theorems, Polynomial interpolation: Newton, Lagrange, Polynomials mod p
Team Selection Test 2009Hard
Show TagsAlgebraic properties of binomial coefficients, Greatest common divisors (gcd), Least common multiples (lcm), Polynomial interpolation: Newton, Lagrange
Harvard-MIT November TournamentHard
Show TagsInduction / smoothing, Polynomial interpolation: Newton, Lagrange
Harvard-MIT November TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange
Harvard-MIT November TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange
13th Annual Harvard-MIT Mathematics TournamentHard
Show TagsIntegers, Polynomial interpolation: Newton, Lagrange
Harvard-MIT Mathematics TournamentHard
Show TagsIntegers, Other, Polynomial interpolation: Newton, Lagrange
Harvard-MIT Mathematics TournamentHard
Show TagsModular Arithmetic, Polynomial interpolation: Newton, Lagrange
Harvard-MIT Mathematics TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange
Team Selection TestHard
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 TournamentHard
Show TagsPolynomial interpolation: Newton, Lagrange, Quadratic functions
Berkeley Math CircleHard
Show TagsAlgebraic properties of binomial coefficients, Induction / smoothing, Polynomial interpolation: Newton, Lagrange
HMMT November 2014Hard
Show TagsComplex numbers, Polynomial interpolation: Newton, Lagrange
HMMT 2014Hard
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.