Theorem: Polynomial Division
Let be a commutative ring and let and be two univariate polynomials over such that the degree of is greater than or equal to the degree of .
If is nonzero, then there exist unique polynomials and such that
where
- or is the zero polynomial.
We call the dividend, the divisor, the quotient and the remainder.
PROOF
TODO
Definition: Divisibility
If , then we say that is divisible by .
Polynomial Remainder Theorem (Little Bézout's Theorem)
Algorithm: Horner's Method
Horner’s method is a way to easily divide a polynomial by a polynomial of degree one.
- Write as . Since , the remainder is just a real number because . This means that we have
- To determine and , construct the following table:
We calculate the table from left to right.
The first coefficient of is equal to the first coefficient of , i.e. .
For all other coefficients of we have .
At the end of the calculation, the right-most cell will contain .
EXAMPLE
Let and . Create the table.
Perform the algorithm step by step.
2
2 6