Test a Suspected Polynomial Root With the Remainder Theorem

You test a suspected polynomial root with the remainder theorem by substituting the candidate value c into the polynomial P(x). If P(c) = 0, then c is a root and (x − c) is a factor. This check requires exactly one arithmetic evaluation, no factoring, no long division. The remainder theorem guarantees that the remainder when dividing P(x) by (x − c) equals P(c). So a zero remainder means exact division, which means c is a root. The whole process takes under 30 seconds for a polynomial of degree 3 or 4, compared to the minutes that full factoring would cost.

Division by (x − c) confirms whether c is a root because the remainder theorem turns the division question into a substitution problem. When you divide P(x) by (x − c), the algorithm produces a quotient Q(x) and a remainder R. The fundamental relationship is P(x) = (x − c) · Q(x) + R. The remainder theorem states that R = P(c). If P(c) = 0, then R = 0, and the division statement becomes P(x) = (x − c) · Q(x). That is an exact factorisation: (x − c) is a factor, and c is a root. You never need to find Q(x) to confirm the root.

Why This Avoids Full Factoring

Full factoring of a cubic or quartic polynomial can require grouping, synthetic division trials, or quadratic formula steps. For P(x) = x³ − 6x² + 11x − 6, factoring by grouping takes four steps and risks sign errors. Testing c = 2 via the remainder theorem takes one: P(2) = (2)³ − 6(2)² + 11(2) − 6 = 8 − 24 + 22 − 6 = 0. That single calculation tells you that 2 is a root and that (x − 2) divides the polynomial exactly. No further factoring is needed for the root test.

The Exact Condition

The remainder theorem only applies when the divisor is a linear binomial of the form (x − c). If the divisor is (x² − 1) or (2x − 5), the remainder is not simply P(c) and the theorem does not hold. For linear divisors, the remainder is a constant, degree 0, which is exactly the value P(c). This is the special case that makes the check fast.

Work one concrete example using inputs from the page-specific fact sheet. Let P(x) = x³ − 6x² + 11x − 6. Test c = 2. Compute P(2):

• 2³ = 8
• −6(2)² = −6 · 4 = −24
• 11(2) = 22
• −6 = −6

Sum: 8 − 24 + 22 − 6 = 0. The remainder is 0, so 2 is a root and (x − 2) is a factor. The quotient from long division is x² − 4x + 3, but you did not need that to confirm the root.

Verification by Long Division

To verify, divide x³ − 6x² + 11x − 6 by (x − 2). Write the dividend in standard form: x³ − 6x² + 11x − 6. The divisor is x − 2. Align terms by degree. The quotient is x² − 4x + 3, remainder 0. Checking: (x − 2)(x² − 4x + 3) = x³ − 4x² + 3x − 2x² + 8x − 6 = x³ − 6x² + 11x − 6. The division confirms the remainder theorem result.

The calculation for testing a root with the remainder theorem is a direct substitution. No division algorithm is needed. For P(x) = x³ − 6x² + 11x − 6 and c = 2, the calculation is:

P(2) = (2)³ − 6(2)² + 11(2) − 6 = 8 − 24 + 22 − 6 = 0.

The remainder theorem synthetic division, however, provides a faster special-purpose check after long division establishes the general division framework. If you already have the polynomial in standard form, substitution is the fastest method. For a polynomial of degree 5, substitution takes about 10 seconds of arithmetic. Full factoring could take 5 minutes.

What to Do With a Non-Zero Result

If P(c) ≠ 0, then c is not a root. The remainder is non-zero, and (x − c) is not a factor. For example, test c = 1 on the same polynomial: P(1) = 1 − 6 + 11 − 6 = 0. That gives zero again, so 1 is also a root. Test c = 3: P(3) = 27 − 54 + 33 − 6 = 0. That is also zero. The polynomial has three roots, and each is confirmed without factoring the whole thing.

The remainder theorem is explained by the division algorithm itself. Every polynomial division can be written as P(x) = (x − c) · Q(x) + R, where R has degree less than the divisor, for linear divisors, that means R is a constant. Substitute x = c into both sides: P(c) = (c − c) · Q(c) + R = 0 · Q(c) + R = R. So the remainder equals P(c). This is not a trick; it is a direct consequence of the definition of division.

Why It Works Without Finding the Quotient

The key insight is that the quotient Q(x) disappears when you substitute x = c because (c − c) = 0. The remainder R is what remains. So the check is independent of Q(x). You never need to compute the quotient to know whether c is a root.

Failure Case: Non-Linear Divisor

The failure case for the remainder theorem occurs when the divisor is not of the form (x − c). For a divisor like (x² − 1), the remainder can be a polynomial of degree 1 or 0, and the relationship P(c) = remainder does not hold. Attempting to test c = 2 by dividing by (x² − 1) and substituting x = 2 into the remainder gives a value, but that value is not simply P(2). The theorem is specific to linear binomial divisors. If you have a quadratic divisor, you must use long division or synthetic division adapted for non-linear divisors, not the remainder theorem.

The remainder theorem fails when the divisor is not linear. For example, dividing P(x) = x³ − 6x² + 11x − 6 by (x² − 1) does not give a remainder equal to P(c) for any single c. The quotient would be x − 6 with a remainder of 12x − 12, which is not a constant. Substituting x = 2 into that remainder gives 12, but P(2) = 0. The mismatch shows the theorem does not apply.

The second failure case is when the divisor has a leading coefficient other than 1 in the form (ax − b). You can still test c = b/a, but the remainder theorem relationship changes: P(b/a) gives the remainder only if you divide by (x − b/a), not by (ax − b). The division by (ax − b) introduces a factor of a in the quotient, and the remainder is P(b/a) only when you scale the divisor appropriately.