Welcome! Today we're exploring The Polynomial Division Algorithm — a powerful technique that extends something you already know into the world of polynomials.
You learned long division with numbers in primary school. Polynomial division follows the exact same idea, with one twist:
Instead of comparing sizes, you compare degrees.
Understanding the division algorithm statement is essential. It tells you:
Pay special attention to the degree condition on the remainder — this is the key detail that makes polynomial division work cleanly.
| What you'll learn | Why it matters |
|---|---|
| Division algorithm statement | The foundation for all polynomial division |
| Degree condition on remainder | Tells you when you're done |
Let's talk about polynomial division
You already know long division with numbers from primary school. The polynomial division algorithm is the algebraic version of that same idea.
The statement has two parts:
Think about integer division:
Here, the remainder () is less than the divisor ().
For polynomials, the same structure holds — but instead of comparing values, we compare degreeskey!.
Your turn ✍️
State the division algorithm for polynomials.
What condition must the remainder satisfy?
The division algorithm for polynomials:
where or .
In words: Dividend = Quotient × Divisor + Remainder, and the remainder has degree STRICTLY LESSkey! than the divisor.
Just like in integer division where (remainder 2 < divisor 5), polynomial division follows the same structure — but we compare degrees instead of values.
Examples of the stopping condition:
The key word is 'degree' — for polynomials, we compare degrees, not values.
Before we execute a polynomial division, there's a useful skill: predicting the degrees of the quotient and remainder before you even start dividing.
These predictions act as sanity checks — if your final answer doesn't match the predicted degrees, you know something went wrong!
Here are the two key rules:
These are your sanity checks — if your final answer doesn't follow these rules, you made a mistake somewhere.
Let's test this 🧪
Suppose you're dividing a degree-4 polynomial by a degree-2 polynomial.
(a) What degree will the quotient have?
(b) What is the maximum possible degree of the remainder?
Predicting degrees before dividing:
Quotient degree = degree(f) − degree(g)
For degree 4 ÷ degree 2: quotient has degree .
So before we even start the long division, we know the quotient will be a degree-2 polynomial — a quadratic.
Remainder degree: must be STRICTLY LESS than degree(g).
For a degree-2 divisor: remainder degree < 2, so at most degree 1.
This means the remainder can be:
The remainder could be:
💡 Pro tip: These predictions are sanity checks. If your quotient has the wrong degree, or your remainder has degree ≥ divisor degree, you made an error somewhere — go back and check your work!