Horner's method
In mathematics, Horner's method (also known as Horner scheme in the UK or Horner's rule in the U.S.) is either of two things: (i) an algorithm for calculating polynomials, which consists of transforming the monomial form into a computationally efficient form; or (ii) a method for approximating the roots of a polynomial. The latter is also known as Ruffini–Horner's method.These methods are named after the British mathematician William George Horner, although they were known before him by Paolo Ruffini and, six hundred years earlier, by the Chinese mathematician Qin Jiushao.
![1 How to Read and Do Proofs [1]](http://s1.studyres.com/store/data/007906654_1-0e74ecf2d08f104b19f4236120932fc3-300x300.png)
![Chapter 4, Arithmetic in F[x] Polynomial arithmetic and the division](http://s1.studyres.com/store/data/000416179_1-cd8ab6f583cc31262823299b7fe0d22a-300x300.png)
