Polynomial division and the remainder and factor theorems
“Apply the division algorithm for polynomials and use the remainder and factor theorems to identify and verify factors and roots”
The division algorithm writes uniquely, the remainder theorem says the remainder on dividing by is , and the factor theorem is the corollary that is a factor of if and only if .
Jump to a section
What this dot point is asking
NESA wants you to divide one polynomial by another (linear divisor at minimum, occasionally quadratic), state the result using the division algorithm, and use the remainder and factor theorems to identify roots without doing the full division when possible.
The answer
The division algorithm for polynomials
If is a polynomial of degree and is a polynomial of degree , then there exist unique polynomials (the quotient) of degree and (the remainder) of degree less than such that
When is linear (degree ), the remainder is a constant.
The remainder theorem
If is divided by , the remainder is . In other words,
This lets you find the remainder without performing the division: just evaluate at .
For a divisor of the form , the remainder is .
The factor theorem
The factor theorem is the special case of the remainder theorem where the remainder is zero.
is a factor of if and only if .
Equivalently, is a root of if and only if is a factor.
The division algorithm writes any division uniquely as with . Two corollaries do most of the work in the HSC:
- Remainder theorem: the remainder on dividing by is just , so you can find a remainder with one substitution instead of a full division. For a divisor , the remainder is .
- Factor theorem: is a factor of exactly when , which turns "is this a factor?" into a single evaluation and links roots to factors.
Long division of polynomials
To divide by , set up the long-division layout and at each step divide the leading term of the current dividend by the leading term of the divisor, multiply back, and subtract.
The integer-division analogy is exact. Stop when the remainder has lower degree than the divisor.
Long division, stage by stage
Long division is procedural, and the marks come from keeping the layout aligned and each subtraction correct. Below, is divided by one stage at a time. (Because is a root, the remainder will turn out to be , confirming is a factor.)
Stage 1, divide the leading terms. Divide the leading term of the dividend by the leading term of the divisor: , which is the first term of the quotient. Multiply it back across the divisor, , write it underneath the matching columns, subtract to get , and bring down the next term .
Stage 2, repeat with the new leading term. Now divide the leading term of the new dividend by : , the second quotient term. Multiply back, , subtract from to leave , and bring down .
Stage 3, finish and reach the remainder. Divide , the last quotient term. Multiply back, , and subtract from to get . The remainder is , so division stops.
Stage 4, write the result in division-algorithm form. Collect the quotient and the remainder : . Because the remainder is , is a factor, and factorising the quadratic gives the full factorisation .
Strategy for factorising a cubic
To fully factorise a cubic over the reals:
- Find one rational root by trial. By the rational root theorem, any rational root (in lowest terms) has constant term and leading coefficient.
- Use the factor theorem to confirm the root.
- Divide by the corresponding linear factor to get a quadratic quotient.
- Factorise the quadratic by the standard methods.
If the quadratic factor has a negative discriminant, the cubic has one real root and two complex conjugate roots.
The rational root theorem in practice
The rational root theorem is the engine that makes factorising higher polynomials tractable. For a polynomial with integer coefficients, any rational root in lowest terms must have dividing the constant term and dividing the leading coefficient. This produces a finite, often short, list of candidates to test. For , the constant is (so ) and the leading coefficient is (so ), giving candidates . Test each with the factor theorem until one gives zero, then divide out the corresponding factor and continue. Without this theorem you would be guessing blindly.
Choosing between division methods
Two methods give the quotient after a factor is found. Long division is the general tool and works for any divisor, linear or quadratic, and is the only choice when the divisor has degree two or more. The equate-coefficients method (writing the quotient with unknown coefficients and comparing both sides) is often quicker for a linear divisor with a tidy quotient. Either is acceptable in the HSC, but show enough working that a marker can follow the steps; a bare quotient with no method risks lost marks if a sign is wrong.
Why the theorems save time
The remainder and factor theorems let you answer "what is the remainder?" or "is this a factor?" with a single substitution, no division required. This is the whole point of the topic: evaluating is far faster than dividing, and for the factor theorem it converts a division question into a root-finding question. Reach for substitution first and only do the full division when you actually need the quotient.
How exam questions ask about division and the theorems
The phrasing tells you whether to substitute or to divide:
- "Find the remainder when is divided by ." Do not divide. Apply the remainder theorem: the answer is . For a divisor , evaluate .
- "Find given the remainder is " or "given is a factor." Set (or for a factor) and solve the resulting equation for the unknown. This is the most common 2 to 3 mark version (see the HSC-style question above).
- "Show that is a factor" or "hence factorise ." First confirm by the factor theorem, then divide by to get the quotient and continue factorising. The "show" step is a substitution; the "hence" step is a division.
- "The remainder when is divided by is..." The remainder has degree less than , so write it as , then use and to set up two equations in and . This is the standard Extension 1 quadratic-divisor remainder question.
- "Solve " for a cubic or quartic. Find one root by testing rational-root candidates with the factor theorem, divide it out, and solve the remaining quadratic. If the quadratic has no real roots, state that the other roots are non-real.
Find a remainder with the remainder theorem
To find the remainder when is divided by , the remainder theorem says the remainder equals evaluated at the root of the divisor. The root of is .
Evaluate :
Final answer: the remainder is .
Confirm a factor with the factor theorem
To show that is a factor of , evaluate . The factor theorem says is a factor if and only if .
Since , the factor theorem confirms that is a factor.
Fully factorise a cubic
To factorise , test integer factors of the constant term. Try :
So is a factor.
Divide to find the quotient and factorise completely:
Divide by . Inspection (or long division) gives quotient , which factors as .
Final answer: .
Divide by a quadratic divisor
To divide by , write with a zero coefficient for the missing term: .
Divide the leading term: . Multiply by the divisor: . Subtract from the dividend:
Check whether the remainder has degree less than the divisor:
The remainder has degree , which is less than the degree of (degree ), so division stops here. The result is:
Final answer: quotient , remainder .
- Sign error on the remainder theorem
- has remainder . has remainder . Move the sign with care.
- Forgetting placeholder zeros
- When long-dividing, you must include zero coefficients for missing powers. is really .
- Using the wrong root from a factor
- is a factor iff , not or .
- Not testing the rational root candidates systematically
- For , candidates are . Try in order and confirm with the factor theorem.
- Stopping at the linear divisor
- A cubic factorises as a product of three linear factors over only if all roots are real. If the quadratic quotient has no real roots, leave it as a quadratic factor.
Pick the fast tool for the question, and show enough working to bank the method marks.
- Reach for the remainder/factor theorem before long division. "Find the remainder" or "show this is a factor" almost always wants a single substitution , not a division. Dividing when a substitution would do wastes time and invites arithmetic slips.
- State the theorem you are using. Writing "by the remainder theorem, remainder " earns a mark even before the arithmetic.
- Mind the sign of the root. uses , and a factor means , not or .
- Insert placeholder zeros for missing powers before long-dividing, and keep like-degree terms in aligned columns; misalignment is the main cause of lost division marks.
- For a quadratic divisor, set the remainder as and solve two equations from the two roots of the divisor, rather than attempting a long division if the roots are convenient.
Exam-style questions
Questions in the style of NESA exam questions on this dot point, each with a worked answer. They are written by ExamExplained unless tagged "Past paper"; the year shows the paper a question is modelled on.
HSC-style2 marksWhen the polynomial is divided by , the remainder is . Find the value of .Show worked answer →
By the remainder theorem, .
, so and .
Markers reward the explicit statement of the remainder theorem, substitution of , and a clean linear solve.
HSC-style3 marksThe polynomial has a factor of . Use this fact to fully factorise over the reals.Show worked answer →
is a factor, confirmed because .
Divide by . Long division or inspection gives the quadratic quotient .
Factor the quadratic: .
.
Markers reward verifying the factor with the factor theorem, performing the division accurately, and producing a fully factored final form.