Polynomial Evaluator

Evaluate any polynomial at a given value of x using Horner method.

Enter coefficients from highest to lowest degree (e.g. "1 -3 2" = x² − 3x + 2)

Examples:

What Is the Polynomial Evaluator?

The Polynomial Evaluator computes the value of any polynomial at a specified x. Enter the coefficients from the highest to the lowest degree (e.g., "1 -3 2" for x² − 3x + 2) and the x value. The tool uses Horner's efficient algorithm and provides direct term-by-term verification.

Formula

Polynomial: P(x) = aₙxⁿ + aₙ₋₁xⁿ⁻¹ + ... + a₁x + a₀ Horner's Method (efficient evaluation): P(x) = (...((aₙ·x + aₙ₋₁)·x + aₙ₋₂)·x + ...)·x + a₀ Requires only n multiplications and n additions (vs. 2n−1 multiplications by direct evaluation) Direct verification: P(x) = Σᵢ aᵢ × xⁱ

How to Use

Type coefficients separated by spaces or commas, from highest degree to lowest (e.g., "2 -5 3 -1" for 2x³ − 5x² + 3x − 1). Enter the value of x. Click Evaluate to see the polynomial representation, Horner's method steps, and the direct verification.

Example Calculation

Evaluate P(x) = x² − 3x + 2 at x = 4: Coefficients: 1 -3 2 Horner's: start with 1 1 × 4 + (−3) = 1 1 × 4 + 2 = 6 P(4) = 6 Direct: 1×4² + (−3)×4 + 2 = 16 − 12 + 2 = 6 ✓ P(x) = x²−3x+2 = (x−1)(x−2), roots at x=1 and x=2

Understanding Polynomial Evaluator

Polynomial functions are the most fundamental class of functions in mathematics. Every continuous function can be approximated arbitrarily closely by a polynomial (Weierstrass approximation theorem), making polynomials the universal approximators of smooth behavior.

Horner's method, published in 1819, is a major optimization. For a degree-n polynomial, direct evaluation requires O(n²) multiplications, while Horner's requires only O(n). For large polynomials, this difference is significant — and Horner's method also has better numerical stability (less floating-point error accumulation).

Polynomials appear throughout applied mathematics: Bézier curves (computer graphics and font design), Lagrange interpolation (fitting data), Taylor series (approximating non-polynomial functions), and control systems (transfer functions in the s-domain).

Frequently Asked Questions

What is Horner's method?

Horner's method (also called synthetic evaluation) rearranges the polynomial to minimize arithmetic operations. Instead of computing each power of x separately, it uses nested multiplication. This reduces n multiplications to n, improving both speed and numerical accuracy.

How do I enter the coefficients?

Enter from highest degree to lowest. For 3x⁴ − x² + 7, enter "3 0 -1 0 7" — include zeros for missing terms. Degree is determined by the number of coefficients minus 1.

What is the degree of a polynomial?

The degree is the highest power of x with a non-zero coefficient. A constant is degree 0, a linear function degree 1, quadratic degree 2, cubic degree 3, etc.

What is polynomial evaluation used for?

Root finding (testing if a value is a root), curve plotting (computing y values), and numerical methods (Newton's method, Bézier curves in graphics) all require polynomial evaluation.

Can I find roots using this tool?

If P(x₀) = 0, then x₀ is a root. You can test candidate values, but this tool does not automatically find roots. Use the Quadratic Solver or Cubic Equation Solver for root finding.

Related Tools