Suppose we follow this mode of forming p(x + a)³ + q(x + a)² + r(x + a) + s.

x³x²x1x²x1x11
p000q00r01
p papa²pa³qqaqa²rra
p2pa3pa² q2qa r
p3pa q
p

px³ + 3pax² + 3pa²x + pa³ + qx² + 2qax + qa² + rx + ra + s

= px³ + (3pa + q)x² + (3pa² + 2qa + r)x + pa³ + qa² + ra + s

Now, observe that all this might be done in one process, by entering q, r, and s under their proper powers of x in the first process, as follows

x³x²x1
pqrs
ppa + qpa² + qa + rpa³ + qa² + ra + s
p2pa + q3pa² + 2qa + r
p3pa + q
p

This process[65] is the one used in [Appendix XI]., with the slight alteration of varying the sign of the last letter, and making subtractions instead of additions in the last column. As it stands, it is the most convenient mode of writing x + a instead of x in a large class of algebraical expressions. For instance, what does 2x⁵ + x⁴ + 3x² + 7x + 9 become when x + 5 is written instead of x? The expression, made complete, is,

2x⁵ +1x⁴ +0x³ +3x² +7x +9
10379
2115527813976994
22116010786787
2313152653
241520
251

Answer, 2x⁵ + 51x⁴ + 520x³ + 2653x² + 6787x + 6994.

APPENDIX XI.
ON HORNER’S METHOD OF SOLVING EQUATIONS.