Synthetic division
In algebra, synthetic division is a method for manually performing Euclidean division of polynomials, with less writing and fewer calculations than long division. It is mostly taught for division by linear monic polynomials (known as the Ruffini's rule), but the method can be generalized to division by 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 , helping to prevent sign errors. Regular synthetic division. The first example is synthetic division with only a monic linear denominator formula_1. The numerator can be written as formula_3. The zero of the denominator formula_4 is formula_5. The coefficients of formula_6 are arranged as follows, with the zero of formula_4 on the left: The after the bar is "dropped" to the last row. The is multiplied by the before the bar, and placed in the . An is performed in the next column. The previous two steps are repeated and the following is obtained: Here, the last term (-123) is the remainder  while the rest correspond to the coefficients of the quotient. The terms are written with increasing degree from right to left beginning with degree zero for the remainder and the result. Hence the quotient and remainder are: 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 formula_6 at formula_17 is equal to the remainder of formula_18. 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 formula_4 with its leading coefficient (call it "a"): then using synthetic division with formula_33 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 formula_4. As can be observed by first performing long division with such a non-monic divisor, the coefficients of formula_35 are divided by the leading coefficient of formula_4 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 formula_4 (in this case, indicated by the "/3"; note that, unlike the rest of the coefficients of formula_4, the sign of this number is not changed). Next, the first coefficient of formula_35 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. Consider the following division: 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: Python implementation. The following snippet implements Expanded Synthetic Division for arbitrary univariate polynomials: def expanded_synthetic_division(dividend, divisor):