Go to content messages.homepage.accessibility

Polynomial division

1. Original procedure of the algorithm

If we divide two polynomials f, g of one variable, we arrange them in the same way as two integers we want to divide.

  1. We put the divident f and the divisor g next to each other.
  2. We find the terms of both polynomials with the largest degree and divide them.
  3. We put the result q_1 of the division next to the divisor g and then multiply p = q_1 \cdot g.
  4. We put the semi-result p below the divident f while respecting the vertical alignment of the terms of the same degree.
  5. We subtract f_1 = f - p and put the polynomial f_1 below the expression p, again with respect to the vertical alignment of the terms of the same degree.
  6. We repeat the procedure with the polynomials f_1, g and receive polynomials f_2, f_3, \dots, f_n, and q_2, q_3, \dots, q_n respectively. The algorithm is finished when the polynomial f_{ n + 1 } is of a lower degree than the divisor g.
  7. The sum q = q_1 + q_2 + q_3 + \dots + q_n is the result of the division f : g (so called quotient) with the remainder f_{ n + 1 }.

We add one specific example – division of two polynomials (Animation 1):

Example 1: Polynomial division
Animation 1: division of two polynomials 3x^4 - 2x^3 +1 and x^2+1

2. Proposals of adaptation

3. Discussion of pros and cons