From Wikipedia, the free encyclopedia - View original article

In algebra, **synthetic division** is a method of performing polynomial long division, with less writing and fewer calculations. It is mostly taught for division by binomials of the form

but the method generalizes to division by any monic polynomial, and to any polynomial.

The advantages of synthetic division are that it allows one to calculate without writing variables, it uses few calculations, and it takes significantly less space on paper than long division. Also, the subtractions in long division are converted to additions by switching the signs at the very beginning, preventing sign errors.

Synthetic division for linear denominators is also called division through Ruffini's rule.

The first example is synthetic division with only a monic linear denominator .

Write the coefficients of the polynomial to be divided at the top (the zero is for the unseen 0*x*).

Negate the coefficients of the divisor.

Write in every coefficient of the divisor but the first one on the left.

Note the change of sign from −3 to 3. "Drop" the first coefficient after the bar to the last row.

Multiply the dropped number by the number before the bar, and place it in the next column.

Perform an addition in the next column.

Repeat the previous two steps and the following is obtained:

Count the terms to the left of the bar. Since there is only one, the remainder has degree zero. Mark the separation with a vertical bar.

The terms are written with increasing degree from right to left beginning with degree zero for both the remainder and the result.

The result of our division is:

**Evaluating Polynomials by the Remainder Theorem**

The above form of synthetic division is useful in the context of the Polynomial remainder theorem for evaluating univariate polynomials. To summarize, the value of at is equal to the remainder of . The advantage of calculating the value this way is that it requires just over half as many multiplication steps as naive evaluation. An alternative evaluation strategy is Horner's method.

This method generalizes to division by any monic polynomial with only a slight modification with **changes in bold**. Using the same steps as before, let's try to perform the following division:

We concern ourselves only with the coefficients. Write the coefficients of the polynomial to be divided at the top.

Negate the coefficients of the divisor.

Write in every coefficient but the first one on the left **in an upward right diagonal** (see next diagram).

Note the change of sign from **1 to −1 and from −3 to 3** . "Drop" the first coefficient after the bar to the last row.

Multiply the dropped number by the **diagonal** before the bar, and place the resulting entries **diagonally to the right** from the dropped entry.

Perform an addition in the next column.

Repeat the previous two steps **until you would go past the entries at the top with the next diagonal**.

Then simply add up any remaining columns.

Count the terms to the left of the bar. Since there are two, the remainder has degree one. Mark the separation with a vertical bar.

The terms are written with increasing degree from right to left beginning with degree zero for both the remainder and the result.

The result of our division is:

With a little prodding, the expanded technique may be generalised even further to work for any polynomial, not just monics. The usual way of doing this would be to divide the divisor with its leading coefficient (call it *a*):

then using synthetic division with as the divisor, and then dividing the quotient by *a* to get the quotient of the original division (the remainder stays the same). But this often produces unsightly fractions which get removed later, and is thus more prone to error. It is possible to do it without first dividing the coefficients of by *a*.

As can be observed by first performing long division with such a non-monic divisor, the coefficients of are divided by the leading coefficient of after "dropping", and before multiplying.

Let's illustrate by performing the following division:

A slightly modified table is used:

Note the extra row at the bottom. This is used to write values found by dividing the "dropped" values by the leading coefficient of (in this case, indicated by the */3*; note that, unlike the rest of the coefficients of , the sign of this number is not changed).

Next, the first coefficient of is dropped as usual:

and then the dropped value is divided by 3 and placed in the row below:

Next, the **new** (divided) value is used to fill the top rows with multiples of 2 and 1, as in the expanded technique:

The 5 is dropped next, with the obligatory adding of the 4 below it, and the answer is divided again:

Then the 3 is used to fill the top rows:

At this point, if, after getting the third sum, we were to try and use it to fill the top rows, we would "fall off" the right side, thus the third sum is the first coefficient of the remainder, as in regular synthetic division. But the values of the remainder are **not** divided by the leading coefficient of the divisor:

Now we can read off the coefficients of the answer. As in expanded synthetic division, the last two values (2 is the degree of the divisor) are the coefficients of the remainder, and the remaining values are the coefficients of the quotient:

and the result is

However, the **diagonal** format above becomes less space-efficient when the degree of the divisor exceeds half of the degree of the dividend. It is easy to see that we have complete freedom to write each product in any row, as long as it is in the correct column. So the algorithm can be **compactified** by a **greedy strategy**, as illustrated in the division below.

The following describes how to perform the algorithm; this algorithm includes steps for dividing non-monic divisors:

- Write the coefficients of the dividend on a bar
- Negate the coefficients of the divisor. Write in every coefficient of the divisor but the first (leading coefficient) one on the left.
- From the number of coefficients placed on the left side, count the number of dividend coefficients above the bar, starting from the rightmost column. Then place a vertical bar on the row below and to the left of that column. This vertical bar marks the separation between the quotient and the remainder.
- Drop the first coefficient of the dividend below the bar.
- Divide the last dropped/summed number by the leading coefficient of the divisor and place it on the row below (this doesn't need to be done if the coefficient is 1). In this case
- Multiply the last dropped/summed number (or the divided dropped/summed number) to each negated coefficients on the left (starting with the left most); skip if the summed number is zero. Place each product on top of the subsequent columns.

- Perform an column-wise addition on the next column.
- Repeat the previous two steps. Stop when you performed the previous two steps on the number just before the vertical bar.

Let

Let

Let - Perform the remaining column-wise additions on the subsequent columns (getting the remainder).
- The results below the horizontal bar would be interpreted with increasing degree from right to left beginning with degree zero for both the remainder and the result.

- Polynomial remainder theorem
- Euclidean domain
- Gröbner basis
- Greatest common divisor of two polynomials
- Horner scheme

- Lianghuo Fan (2003). "A Generalization of Synthetic Division and A General Theorem of Division of Polynomials".
*Mathematical Medley***30**(1): 30–37.

- Li Zhou (2009). "Short Division of Polynomials".
*College Mathematics Journal***40**(1): 44–46.