Horner's Method Calculator

Enter the polynomial coefficients and an x value to evaluate it via Horner's method.

How it is calculated

Coefficients are read from a comma-separated list, highest power first, and the polynomial is evaluated by nesting: start with r = 0, then for each coefficient c in order do r = r × x + c. After the last coefficient, r equals anxn + … + a1x + a0. The degree shown is the number of coefficients minus 1, not counting leading zero coefficients. The value and the echoed x are shown to 4 decimals. An empty slot between commas (1,,2) counts as a zero coefficient and one trailing comma is ignored. A non-numeric entry returns nothing, and a missing power must be written as 0 (for example 1,0,0,-1 for x³ − 1), because the position in the list sets the power. A result too large to represent also shows nothing.

Worked example

Evaluate 2x³ − 6x² + 2x − 1 at x = 3, entering the coefficients as 2,-6,2,-1. Step 1: r = 2. Step 2: 2 × 3 + (−6) = 0. Step 3: 0 × 3 + 2 = 2. Step 4: 2 × 3 + (−1) = 5. The tool prints 5.0000 with degree 3. Direct check: 2×27 − 6×9 + 2×3 − 1 = 54 − 54 + 6 − 1 = 5. The nested form needed only three multiplications and no powers of x.

Try this example →

Common mistakes

  • Entering the coefficients lowest power first. The list is read highest-degree first, so -1,2,-6,2 describes a different polynomial from 2,-6,2,-1.
  • Skipping a zero coefficient. For x⁴ − 1 you must enter 1,0,0,0,-1; entering 1,-1 gives x − 1 instead.
  • Leaving an empty slot by accident. 1,,2 is read as 1,0,2 (x² + 2, degree 2), so a doubled comma silently inserts a zero coefficient. At x = 2 it gives 6, not the 4 you would get from 1,2.
  • Separating coefficients with spaces or semicolons. Only commas split the list, so 2 -6 2 is rejected as not a number.
  • Trusting the degree when the first coefficient is 0. Leading zero coefficients do not raise the degree: 0,0,3 is shown as degree 0 because it is just the constant 3, so check that the degree matches the polynomial you meant.

About this calculator

Horner’s method (also called Horner’s scheme or nested multiplication) evaluates a polynomial at a given x value far more efficiently than computing each term’s power directly. A polynomial like a₃x³ + a₂x² + a₁x + a₀ is rewritten in nested form as ((a₃x + a₂)x + a₁)x + a₀: starting from the highest-degree coefficient, each step multiplies the running result by x and adds the next coefficient down, working through the coefficients highest-degree first.

This nested form needs only n multiplications and n additions to evaluate a degree-n polynomial, versus the roughly n(n+1)/2 multiplications a naive term-by-term approach requires when each power of x is computed separately — making Horner’s method both faster and less prone to floating-point rounding error. It’s the standard technique behind synthetic division and root-finding algorithms in numerical computing, and it’s how calculators, compilers, and scientific software libraries evaluate polynomials internally. This calculator takes a list of coefficients (highest degree first) and an x value and evaluates the polynomial via Horner’s method.

Was this helpful?

You can pick up to 3 reactions.

Comments (0)

  • Be the first to comment.

Popular calculators

All Calculators