1 Statement of the theorem

The polynomial remainder theorem states that when a polynomial is divided by a linear factor of the form x - a, the remainder is the value of the polynomial at a. In other words, if p(x) is divided by x - a, then the remainder is p(a). This result connects algebraic division with evaluation at a specific point and is one of the most useful basic facts about polynomials.

1.1 Polynomial division by x - a

For any polynomial p(x), division by x - a produces a quotient q(x) and a remainder r, so that p(x) = (x - a)q(x) + r. Since the divisor has degree 1, the remainder must have degree less than 1, which means it is a constant. This makes the case especially simple and allows the theorem to take a very direct form.

1.2 Remainder as a constant

The remainder in this division cannot depend on x. Because the divisor is linear, the remainder must be a constant number rather than another polynomial with x terms. That constant is determined uniquely by the division process.

1.3 Value of the polynomial at a

Substituting x = a into p(x) = (x - a)q(x) + r gives p(a) = r, because the factor x - a becomes zero. This shows that the remainder is exactly the polynomial’s value at a. The theorem therefore identifies a division result with a function value.

2 Proofs

Several standard proofs of the remainder theorem use different algebraic viewpoints. Each one leads to the same conclusion: the remainder after division by x - a is p(a).

2.1 Proof using the division algorithm

The polynomial division algorithm guarantees that a polynomial p(x) can be written as p(x) = (x - a)q(x) + r, where r is constant. Evaluating both sides at x = a yields p(a) = r. This is the most common proof, since it follows directly from the general division rule for polynomials.

2.2 Proof by direct substitution

A direct substitution argument uses the fact that x - a vanishes when x = a. In the identity p(x) = (x - a)q(x) + r, setting x = a removes the quotient term entirely. The remaining value is exactly the constant remainder, so p(a) must equal r.

2.3 Proof using coefficient comparison

Another approach compares coefficients after dividing a polynomial by x - a. Since the remainder is constant, the division produces an expression whose terms must match those of the original polynomial. Matching the value at x = a gives the same constant remainder, confirming the theorem from a coefficient-based perspective.

The remainder theorem has several immediate consequences in elementary algebra. It leads naturally to criteria for roots and factors, and it provides a practical way to study polynomial divisibility.

3.1 Factor theorem

The factor theorem follows directly from the remainder theorem. If p(a) = 0, then the remainder upon division by x - a is zero, which means x - a divides p(x) exactly. Thus x - a is a factor of p(x) precisely when a is a root of the polynomial.

3.2 Root testing

The theorem gives a quick way to test whether a candidate number is a zero of a polynomial. By evaluating p(a), one can determine whether x - a is a factor without performing full division. This is especially useful when checking possible rational roots or simple numerical values.

3.3 Divisibility by linear factors

A polynomial is divisible by x - a if and only if p(a) = 0. This criterion is a standard tool for determining factors of polynomials and for building factorizations step by step. It is especially effective when combined with repeated testing of possible values.

4 Applications

The remainder theorem appears in many routine polynomial calculations. It is used both for quick evaluation and for organizing more elaborate algebraic procedures.

4.1 Evaluating polynomial remainders

If one needs the remainder after dividing p(x) by x - a, it is unnecessary to carry out long division. Evaluating p(a) gives the answer immediately. This shortcut is efficient for hand calculations and is often the fastest method in introductory algebra.

4.2 Finding zeros of polynomials

Because p(a) = 0 indicates that a is a root, the theorem helps identify zeros of polynomials. Once a zero is found, the polynomial can often be reduced by dividing out the corresponding linear factor. Repeating this process can simplify the search for all roots.

4.3 Factoring polynomials

The theorem supports factorization by confirming whether a proposed linear factor actually divides a polynomial. After testing a candidate value a, one can decide whether x - a should appear in the factorization. This makes it a practical companion to factorization methods such as grouping and rational root checks.

4.4 Synthetic division

Synthetic division is a streamlined method for dividing by x - a. It produces the quotient coefficients and the remainder efficiently, especially for polynomials with many terms. The final number in the synthetic division process is the remainder, which equals p(a) by the remainder theorem.

5 Examples

Examples make the theorem’s meaning concrete. They show how evaluation, division, and factorization all align in simple and more elaborate cases.

5.1 Simple numerical examples

For p(x) = x^2 + 3x + 2, dividing by x - 1 gives remainder p(1) = 1 + 3 + 2 = 6. Likewise, dividing by x + 2 is the same as dividing by x - (-2), so the remainder is p(-2) = 4 - 6 + 2 = 0. In the second case, the polynomial is divisible by x + 2.

5.2 Higher-degree polynomial examples

If p(x) = 2x^4 - x^3 + 5x - 7, then the remainder upon division by x - 3 is p(3) = 2(81) - 27 + 15 - 7 = 143. For a higher-degree polynomial, the same rule still applies without modification. The degree of the polynomial does not change the theorem’s basic use.

5.3 Special cases

If a = 0, then dividing by x gives remainder p(0), the constant term of the polynomial. If p(a) = 0, the remainder is zero and x - a is a factor. These special cases are simple but important because they often appear in computations and factor checks.

6 Extensions and generalizations

The remainder theorem is a special case of broader ideas about polynomial division. Related results appear in other algebraic settings and for divisors of different forms.

6.1 Remainder on division by x - a in other settings

The theorem holds over many number systems, including real and complex coefficients, as long as polynomial division by a linear factor is defined. The same logic applies in those contexts because the divisor still has degree 1 and the remainder must still be constant. The evaluation step continues to identify that constant.

6.2 Multivariable and abstract algebra analogues

Analogous ideas appear in multivariable algebra and in abstract algebra, where evaluation at a point can correspond to a homomorphism. In such settings, a division-like identity may still produce a remainder interpreted through substitution or modular relations. These generalizations preserve the basic theme of connecting algebraic reduction with evaluation.

6.3 Remainder theorem for other divisors

For divisors other than x - a, the remainder may have higher degree. In that case, the simple equality remainder = p(a) no longer applies directly. More general division theorems still describe the remainder, but the result is no longer reduced to a single evaluation at one point.

7 Common misconceptions

The theorem is straightforward, but several misunderstandings can arise when it is first learned. These usually involve confusing the roles of the quotient, the remainder, and the value a.

7.1 Confusing remainder with quotient

The remainder theorem identifies only the remainder, not the quotient. The quotient is the polynomial factor left after dividing, and it must be found separately if needed. The theorem does not say that p(a) equals the quotient.

7.2 Misinterpreting the role of a

The number a is the value that makes the divisor x - a equal to zero. It is not the remainder itself and does not need to be a root. Only when p(a) = 0 does a become a root of the polynomial.

7.3 Using the theorem with non-linear divisors

The theorem applies directly only to divisors of the form x - a. For divisors such as x^2 + 1 or x - a times another factor, the remainder is not given simply by evaluating at a single number. In those cases, a full division method is required.