1. Regular synthetic division
    Evaluating polynomials by the remainder theorem 

2. Expanded synthetic division
     For non-monic divisors    Compact Expanded Synthetic Division    Python implementation  

3. See also

4. References

5. External links

In algebra, synthetic division is a method of performing Euclidean division of polynomials, with less writing and fewer calculations than occur with polynomial long division. 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.

Regular synthetic division

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

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

Negate the coefficients of the divisor.

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

"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 and this is the one right-most term under the bar. 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.

Expanded synthetic division

This method generalizes to division by any monic polynomial with only a slight modification with changes in bold. Using the same steps as before, 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 and this is the two right-most terms under the bar. 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:

For non-monic divisors

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 reducing the coefficients of .

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

Compact Expanded Synthetic Division

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

Ignoring the first (leading) coefficient of the divisor, negate each coefficients and place them on the left-hand side of the bar.

From the number of coefficients placed on the left side of the bar, count the number of dividend coefficients above the bar, starting from the rightmost column. Then place a vertical bar to the left, and as well as the row below, 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.

In this case .

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 (calculating the remainder).

The bottommost results below the horizontal bar are coefficients of the polynomials, the remainder and the quotient. Where the coefficients of the quotient is to the left of the vertical bar separation, and the coefficients of the remainder to the right. These coefficients would be interpreted with increasing degree from right to left beginning with degree zero for both the remainder and the quotient. We interpret the results to get:

Python implementation

The following snippet implements the Extended Synthetic Division for non-monic polynomials (which also supports monic polynomials, since it is a generalization):

def extended_synthetic_division(dividend, divisor):

    '''    Fast polynomial division by using Extended Synthetic Division.     Also works with non-monic polynomials.

    dividend and divisor are both polynomials, which are here simply lists of coefficients.     Eg: x**2 + 3*x + 5 will be represented as [1, 3, 5]    '''    out = list(dividend) # Copy the dividend    normalizer = divisor[0]    for i in range(len(dividend) - len(divisor) + 1):        out[i] /= normalizer # for general polynomial division (when polynomials are non-monic),                             # we need to normalize by dividing the coefficient with the divisor's first coefficient        coef = out[i]        if coef != 0: # useless to multiply if coef is 0            for j in range(1, len(divisor)): # in synthetic division, we always skip the first coefficient of the divisor,                                             # because it is only used to normalize the dividend coefficients                out[i + j] += -divisor[j] * coef    '''    The resulting out contains both the quotient and the remainder, the remainder being the size of the divisor (the remainder    has necessarily the same degree as the divisor since it is what we couldn't divide from the dividend), so we compute the index    where this separation is, and return the quotient and remainder.    '''    separator = 1 - len(divisor)    return out[:separator], out[separator:] # return quotient, remainder.

See also

• Euclidean domain
• Greatest common divisor of two polynomials
• Gröbner basis
• Horner scheme
• Polynomial remainder theorem
• Ruffini's rule

References

• {{cite journal |author=Lianghuo Fan |title=A Generalization of Synthetic Division and A General Theorem of Division of Polynomials |journal=Mathematical Medley |year=2003 |volume=30 |issue=1 |pages=30–37 |url=http://eprints.soton.ac.uk/168861/1/FLH_article_on_polynomial_division.pdf}}
• {{cite journal |author=Li Zhou |title=Short Division of Polynomials |journal=College Mathematics Journal |year=2009 |volume=40 |issue=1 |pages=44–46 |doi=10.4169/193113409x469721}}

External links

• {{MathWorld |title=Synthetic Division |id=SyntheticDivision |author=Goodman, Len; Stover, Christopher; and Weisstein, Eric W. }}
• {{MathWorld |title=Ruffini's Rule |id=RuffinisRule |author=Stover, Christopher }}
• {{Britannica|578673|Synthetic division (mathematics)}}

• Miles ISD
• Miles James
• Miles J. Berkeley
• Miles J. Breuer
• Miles Jones
• Miles Joseph
• Miles J. Stanford
• Miles Jupp
• Miles Kelly Publishing
• Miles Lake (Alaska)
• Miles Laurence
• Miles Law School
• Miles Lewis
• Miles Lord
• Miles M.17
• Miles M.28
• Miles M28
• Miles M.2 Hawk Trainer
• Miles M.30
• Miles M.35
• Miles M.39
• Miles M.39B
• Miles M.39B Libellula
• Miles M.57
• Miles Macdonell Collegiate