How can the remainder and factor theorems tell us the result of a division, and even fully factor a polynomial, without carrying out the long division?
Use the remainder theorem (the remainder on division by x - a is P(a)) and the factor theorem ((x - a) is a factor if and only if P(a) = 0), test divisors of the constant term to locate integer zeroes, and combine these with division to find unknown coefficients and to fully factor a polynomial
A first-contact answer to the HSC Maths Extension 1 dot point on the remainder and factor theorems. The remainder on division by (x - a) is P(a); (x - a) is a factor exactly when P(a) = 0; an integer zero must divide the constant term. Find remainders without dividing, find unknown coefficients, and fully factor a cubic, with worked examples.
Reviewed by: AI editorial process; not yet individually human-reviewed
Have a quick question? Jump to the Q&A page
What this dot point is asking
On the previous page you divided one polynomial by another with the full long-division tableau, and you saw that the remainder appears at the foot of the working. That is reliable but slow, and for the most common case, a linear divisor , there is a shortcut that gets the remainder in a single line. The remainder theorem says that the remainder on dividing by is simply , the value of the polynomial at . From that one idea everything else on this page follows: the factor theorem (a divisor leaves no remainder exactly when that value is zero), a quick test for which whole numbers could possibly be zeroes, and a clean method to factor a cubic or quartic by hand.
This is the Year 11 first-contact version, reasoned from the division algorithm you have already met. The applied, exam-heavy treatment that leans on these theorems lives on the Year 12 page on polynomial division and the factor theorem, and the link from factors to the sum and product of roots is developed at roots and coefficients. Here the goal is to make these two theorems automatic and to use them to factor a polynomial without grinding through repeated long divisions.
The answer
The remainder theorem
Start from the division algorithm with a linear divisor. Dividing by gives a quotient and a remainder whose degree is less than , that is, a constant :
This identity is true for every value of , so substitute the one value that kills the quotient term. Putting makes the bracket , and the whole piece vanishes, leaving . The remainder is exactly .
The power of this is that a four-line tableau collapses into one substitution. On the previous page the long division of by ended with remainder . The remainder theorem gets the same number immediately:
The two methods agree, as they must, because is the remainder. Long division still earns its keep when you also need the quotient (for example, to finish a factorisation), but for the remainder alone, substitution wins every time.
The factor theorem
A remainder of zero is special: it means the divisor goes in exactly, so is a factor of . Combine that with the remainder theorem, which says the remainder is , and you get a one-step test for factors.
This is the bridge between the two ways of describing a polynomial, its zeroes (where the graph meets the -axis) and its factors (how it splits into a product). Every zero corresponds to a factor , and vice versa, which is the engine behind factoring by hand and behind reading a factored form straight off a graph (developed at graphs of polynomials and multiplicity).
The integer-zero test: which numbers to try
The factor theorem gives a test for a given number, but it does not say which numbers to try. For a polynomial with integer coefficients there is a sharp restriction that cuts the search to a short list.
The reason is short. Suppose is an integer zero of . Then
so . Every term on the right has a factor of , so divides . An integer zero therefore cannot be anything except a divisor of the constant term, which is why you only ever test those divisors. (This is the integer case of the wider rational-root idea: a rational zero in lowest terms has dividing the constant term and dividing the leading coefficient. For a monic polynomial , so the only rational zeroes are integers dividing .)
So to start factoring you do not guess wildly: the constant term is , so the only possible integer zeroes are . You test those eight numbers with the remainder theorem until one gives zero.
Fully factoring a polynomial
Putting the three ideas together gives a dependable hand method for factoring a cubic or quartic that does not factor by inspection:
- List the candidates. Write down the divisors of the constant term (both signs). These are the only possible integer zeroes.
- Find one zero. Test the candidates with the remainder theorem until some . By the factor theorem, is then a factor.
- Divide it out. Long-divide by to get , dropping the degree by one.
- Repeat or finish. Factor the quotient : if it is a quadratic, use the usual methods (or the quadratic formula); if it is still a cubic, repeat the search on . Stop when you have a product of linear factors and, if any quadratic factor has a negative discriminant, leave that quadratic as an irreducible factor over the reals.
Each pass turns one zero into one linear factor and shrinks the problem, so a cubic takes one division and a quartic at most two. The division step is exactly the long division from the previous page; the new content here is using the theorems to find that first factor without trial division.
Handling a non-monic linear factor
A factor like is linear but not of the form . The fix is to find the value of that makes it zero. Setting gives , so is a factor of exactly when . More generally is a factor when , because is the zero of that linear expression. You test the fraction, not a whole number, but the logic is identical to the factor theorem.
How exam questions ask about these theorems
The wording is predictable once you map it to the right theorem.
- "Find the remainder when is divided by ." Remainder theorem: evaluate and write it down. No division.
- "Show that is a factor of " or "Show that is a zero." Factor theorem: compute and state it equals , so is a factor.
- "When is divided by the remainder is ; find the unknown." Set and solve for the unknown coefficient. Two such conditions give two equations to solve simultaneously.
- "Given is a factor, find ." Set and solve for ; "divisible by" and "is a factor" both mean remainder zero.
- " is a factor; use this to factor ." Confirm with , divide it out, then factor the quotient.
- "Factor completely." Run the full method: divisors of the constant, find a zero, divide out, factor the quotient, and check by expanding.
Practice questions
Original practice questions graded from foundation to exam level, each with a full worked solution. Try them before revealing the solution.
foundation2 marksUse the remainder theorem to find the remainder when is divided by .Show worked solution β
State the theorem. The remainder on division by is . Here the divisor is , so and the remainder is .
Substitute .
State the remainder. The remainder is . No long division is needed; one substitution does it.
foundation4 marksThe polynomial is . Show that is a factor, then factor completely.Show worked solution β
Apply the factor theorem. The divisor equals , so test . If then is a factor.
so is a factor.
Divide out the known factor. Dividing by gives the quotient , so .
Factor the quadratic. , hence
Check by expanding back. . The factorisation is correct.
core4 marksFind the value of for which is a factor of . Using that value of , factor completely.Show worked solution β
Use the factor theorem as an equation. If is a factor then . Substitute and treat as the unknown:
so and .
- Write the polynomial with
- .
- Divide out
- Dividing gives the quotient , so .
- Factor the quadratic
- , hence
Check by expanding back. . Correct, with .
core4 marksThe polynomial leaves a remainder of when divided by , and is divisible by . Find and .Show worked solution β
Turn each condition into an equation. By the remainder theorem, dividing by gives remainder , so . Divisible by means the remainder there is zero, so by the factor theorem .
Form the first equation from .
Form the second equation from .
Solve the pair. Adding and gives , so ; then from .
Check both conditions. With : and . Both hold, so and .
exam5 marksFactor completely over the real numbers.Show worked solution β
- List the candidate zeroes
- Every coefficient is an integer, so any integer zero must divide the constant term . The candidates are .
- Test small candidates with the remainder theorem
- , so is a factor. , so is a factor. , so is a factor.
- Account for the degree
- Three distinct factors , , multiply to a cubic, but has degree , so one zero is repeated. Their product has constant term , while has constant term ; the missing factor must have constant term , identifying the repeat as a second .
- Write the full factorisation
Check by expanding back. and ; multiplying, . The factorisation is verified.
exam5 marksThe polynomial has as a factor, and leaves a remainder of when divided by . Find and , then factor completely.Show worked solution β
Convert the non-monic factor into a substitution. at , so being a factor means .
Multiplying through by gives , so
Use the remainder condition. The remainder on division by is :
Solve the pair. Subtracting from gives ; then from .
Factor with , . So . Dividing out gives the quotient , hence
Check by expanding back. , and . The factorisation is verified, with , and zeroes .
Related dot points
- Divide one polynomial by another using long division, expressing the result in the form P(x) = D(x)Q(x) + R(x) where the remainder has degree less than the divisor, handling missing terms, and writing the result in the rational form P/D = Q + R/D
A first-contact answer to the HSC Maths Extension 1 dot point on dividing polynomials. The division algorithm P(x) = D(x)Q(x) + R(x) with deg R less than deg D, long division by linear and quadratic divisors, handling missing terms with zero coefficients, the remainder form P/D = Q + R/D, and checking by reconstruction, with worked examples.
- Define a polynomial and use the language of degree, leading term, leading coefficient, monic and the zero polynomial, including the degree of sums and products and equating coefficients of identically equal polynomials
A first-contact answer to the HSC Maths Extension 1 dot point on the language of polynomials. Degree, leading term and coefficient, monic and the zero polynomial, the degree of sums and products, equating coefficients of identically equal polynomials, and even and odd polynomials, with worked examples.
- Sketch the graph of a polynomial in factored form using the behaviour of the leading term for large x and the multiplicity of each zero, deciding where the curve crosses, touches or has a horizontal inflection, and locate a zero between integers from a table of values
A first-contact answer to the HSC Maths Extension 1 dot point on sketching polynomials. End behaviour from the leading term, the multiplicity rule (cross, touch, horizontal inflection), a stage-by-stage sketch from factors, and locating a zero between integers from a value table, with worked examples.
- Apply the division algorithm for polynomials and use the remainder and factor theorems to identify and verify factors and roots
A focused answer to the HSC Maths Extension 1 dot point on polynomial division. The division algorithm, the remainder theorem, the factor theorem, and using these to factorise cubics and quartics, with worked examples.
- Use the relationships between roots and coefficients (Vieta's formulas) for polynomials of degree two, three and four
A focused answer to the HSC Maths Extension 1 dot point on the relationships between roots and coefficients. Sum and product of roots, sum of roots taken in pairs, and applications to building polynomials from given root conditions, with worked examples.