A polynomial f(x) = a0 + a1x + a2x2 + … + an xn can be written as
Requiring n multiplications and n additions, this rearrangement is optimal. The method was widely used in the evaluation of polynomials before the advent of computers. When combined with Newton-Raphson to find roots, it is sometimes called the Horner-Newton method.