Remainder and Factor Theorems

Suppose someone asks you: what is the remainder when x^{50} - 3x + 7 is divided by (x - 1)?

You could set up polynomial long division — fifty rounds of it, peeling off one power of x at each step. But there is a much faster way: just plug in x = 1. You get 1 - 3 + 7 = 5. The remainder is 5.

That shortcut is the Remainder Theorem, and it is not a trick — it is a theorem with a clean one-line proof. It says something deep about the connection between dividing a polynomial and evaluating it. And its special case, the Factor Theorem, is the engine behind nearly every factoring technique you will use from here to JEE Advanced.

The division identity

Before stating the theorems, recall how polynomial division works. When you divide a polynomial p(x) by a non-zero polynomial d(x), you get a quotient q(x) and a remainder r(x) such that

with \deg(r) < \deg(d). This identity holds for all values of x — it is an identity of polynomials, not just an equation at a particular point.

When the divisor is linear — d(x) = (x - a) — its degree is 1, so the remainder must have degree less than 1. That means the remainder is a constant: a single number, not a polynomial in x. Call it R. The division identity becomes:

This is the setup for both theorems.

The Remainder Theorem

Proof

Start with the division identity:

This holds for every value of x. In particular, it holds for x = a. Substitute:

So R = p(a). The remainder equals the polynomial evaluated at a.

That is the entire proof — three lines. The key move is the substitution x = a, which kills the (x - a) factor and leaves only the remainder.

What it means

The theorem says that two operations that look completely different are secretly the same:

1. Long division of p(x) by (x - a), then reading off the remainder.
2. Evaluation of p(x) at x = a.

Both give the same number. So whenever you need a remainder after dividing by a linear polynomial, skip the division and just evaluate.

Finding remainders quickly

Here is the power of the theorem in action. Find the remainder when p(x) = x^4 - 3x^3 + 2x^2 + x - 5 is divided by (x - 2).

Instead of four rounds of long division, evaluate p(2):

The remainder is -3. One line of arithmetic.

What about dividing by (x + 3)? Write (x + 3) as (x - (-3)), so a = -3. Evaluate p(-3):

The remainder is 172. Again, one evaluation — no division needed.

The Factor Theorem

The Factor Theorem is the Remainder Theorem with the remainder set to zero.

Proof

"If" direction. Suppose p(a) = 0. By the Remainder Theorem, the remainder when dividing p(x) by (x - a) is p(a) = 0. So the division identity becomes p(x) = (x - a) \cdot q(x) + 0 = (x - a) \cdot q(x). This means (x - a) divides p(x) exactly — it is a factor.

"Only if" direction. Suppose (x - a) is a factor of p(x). Then p(x) = (x - a) \cdot q(x) for some polynomial q(x). Substitute x = a: p(a) = (a - a) \cdot q(a) = 0.

Both directions are one-liners. The theorem is logically a biconditional: p(a) = 0 \Leftrightarrow (x - a) divides p(x).

What it means

The Factor Theorem converts a factoring question into an evaluation question. Instead of trying to guess or force a factorization, you test values. If you find a value a where p(a) = 0, you know (x - a) is a factor. Then you can divide p(x) by (x - a) — using long division or synthetic division — to find the quotient, and repeat the process on the quotient.

This is the standard strategy for factoring polynomials of degree 3 and higher: find a root by testing, peel off the corresponding linear factor, and reduce the problem to a lower degree.

Factorization using the Factor Theorem

Here is the method in full. Take p(x) = x^3 - 6x^2 + 11x - 6.

Step 1. Hunt for a root. Try small integers. If p(x) has integer coefficients and a rational root p/q in lowest terms, then p divides the constant term and q divides the leading coefficient. Here the leading coefficient is 1 and the constant term is -6, so any rational root must be a divisor of -6: try \pm 1, \pm 2, \pm 3, \pm 6.

p(1) = 1 - 6 + 11 - 6 = 0. Found one: x = 1 is a root, so (x - 1) is a factor.

Step 2. Divide out the known factor. Divide x^3 - 6x^2 + 11x - 6 by (x - 1). By long division (or synthetic division):

x^3 - 6x^2 + 11x - 6 = (x - 1)(x^2 - 5x + 6)

Step 3. Factor the quotient. The quotient x^2 - 5x + 6 is a quadratic. Find two numbers that multiply to 6 and add to -5: that is -2 and -3. So x^2 - 5x + 6 = (x - 2)(x - 3).

Step 4. Write the full factorization.

The three roots are 1, 2, 3 — a degree-3 polynomial factored into three linear factors, exactly as the Fundamental Theorem of Algebra predicts.

Two worked examples

Common confusions

• "The Remainder Theorem works for any divisor." In its standard form, it works only for linear divisors (x - a). When you divide by a higher-degree polynomial like (x^2 + 1), the remainder is a polynomial (of degree less than 2), and a single evaluation does not determine it. You need two evaluations — or long division — for a quadratic divisor.

• "If p(2) = 0, then (x + 2) is a factor." Watch the sign. p(2) = 0 means (x - 2) is a factor. p(-2) = 0 means (x - (-2)) = (x + 2) is a factor. The factor is (x - a) where a is the value you plugged in, not its negative.

• "The Factor Theorem only works for integer roots." The theorem works for any value — integer, rational, irrational, or complex. If p(\sqrt{2}) = 0, then (x - \sqrt{2}) is a factor. The rational root theorem restricts candidates to rational numbers, but the Factor Theorem itself has no such restriction.

• "Once I find one root, the polynomial is factored." Finding one root gives you one linear factor and a quotient of degree n - 1. You still need to factor the quotient. For a cubic, one root reduces you to a quadratic, which you can factor or use the quadratic formula on. For a quartic, one root leaves a cubic, which needs more work.

• "I can skip the verification step." You can, but verifying costs seconds and catches sign errors that would otherwise cascade through the rest of the problem. Multiply out your factors and confirm you recover the original polynomial. This is especially important in exam settings.

Going deeper

Synthetic division — the fast lane

When dividing by (x - a), the long-division algorithm simplifies to a compact table called synthetic division. For the division of 3x^4 - 5x^3 + 0x^2 + 2x - 7 by (x - 2) from Example 1, the setup uses only the coefficients [3, -5, 0, 2, -7] and the value a = 2:

Start with 3. Multiply by 2: 6. Add to -5: 1. Multiply by 2: 2. Add to 0: 2. Multiply by 2: 4. Add to 2: 6. Multiply by 2: 12. Add to -7: 5.

The bottom row reads [3, 1, 2, 6, 5]. The first four entries are the quotient coefficients (3x^3 + x^2 + 2x + 6) and the last is the remainder (5). This is exactly the same result as the long division, but with about a quarter of the writing.

Synthetic division is really the Remainder Theorem in disguise: the last number in the row is always p(a), and the process of building the quotient is equivalent to evaluating p(x) using Horner's method (nested multiplication).

Horner's method

Horner's method rewrites a polynomial for efficient evaluation. Instead of computing each power of x separately, you nest the multiplications:

Each step is one multiplication and one addition. For x = 2: start with 3. Multiply by 2, add -5: 1. Multiply by 2, add 0: 2. Multiply by 2, add 2: 6. Multiply by 2, add -7: 5. Same sequence as synthetic division — because they are the same algorithm.

Generalization: remainder when dividing by (x - a)(x - b)

When dividing p(x) by a quadratic (x - a)(x - b) with a \neq b, the remainder is a linear polynomial rx + s. You can find it without full long division by using the Remainder Theorem twice:

The remainder rx + s must satisfy p(a) = ra + s and p(b) = rb + s. These two equations in two unknowns (r and s) determine the remainder uniquely. Solving:

This is a direct extension of the Remainder Theorem to quadratic divisors — the evaluation trick applied twice.

The Remainder Theorem as a ring homomorphism

For readers who have met abstract algebra: the Remainder Theorem says that the map \phi_a : \mathbb{R}[x] \to \mathbb{R} defined by \phi_a(p) = p(a) — the "evaluation at a" map — is a ring homomorphism whose kernel is the ideal (x - a). The Factor Theorem says exactly that p is in the kernel of \phi_a if and only if (x - a) divides p. The division identity is the statement that \mathbb{R}[x]/(x - a) \cong \mathbb{R} — the quotient ring is just the real numbers. All of the concrete work in this article is this single abstract fact made computational.

Where this leads next

The two theorems are the gateway tools for all advanced polynomial work.

• Polynomial Factorization — systematic techniques for breaking polynomials into irreducible factors, building on the Factor Theorem.
• Polynomial Equations — the Fundamental Theorem of Algebra and root-coefficient relations, where the Factor Theorem guarantees the existence of the factorization.
• Polynomial Operations — addition, subtraction, multiplication, and division of polynomials, including the long-division algorithm used throughout this article.
• Algebraic Identities — the standard identities that speed up factoring when the Factor Theorem points you to a root.
• Quadratic Equations — the degree-2 case, where the Factor Theorem and the quadratic formula meet.