2.1.15 · D5Algebra — Introduction & Intermediate

Question bank — Remainder theorem and factor theorem — proof and applications

1,407 words6 min readBack to topic

This is a rapid-fire trap page for the parent topic. Each line is a claim, a question, or a broken bit of reasoning — read the left side, decide your answer, then reveal. The reasoning on the right is what actually matters.


True or false — justify

Every claim below is either fully true or has a hidden flaw. The reveal explains the reasoning, not just the verdict.

The remainder when is divided by is always a single constant, never a polynomial in .
True — the remainder's degree must be less than the divisor's degree; since has degree 1, the only allowed remainder degree is 0, i.e. a constant (or zero).
If then is guaranteed to be a factor of .
True — this is the reverse direction of the Factor Theorem: forces the remainder to be zero, so exactly.
The Remainder Theorem only works if has integer coefficients.
False — the proof uses only "substitute to kill the factor", which is valid for any real (or complex) coefficients.
Dividing by and evaluating can give different remainders.
False — the Remainder Theorem proves they are the same value; if you got different answers, one of the two computations has an arithmetic error.
If is a factor of , then is a root of the equation .
True — "factor" means remainder zero, which by the Remainder Theorem means , and is exactly the statement " is a root".
The remainder from dividing by tells you the quotient too.
False — the theorem gives you only the remainder (); to get the quotient you still need long or synthetic division.
If has degree 3, then has of degree 2.
True — dividing a degree-3 polynomial by a degree-1 factor drops the degree by exactly one, so has degree 2.
being a factor of means every value of near is zero.
False — it only means at the single point ; the graph crosses (or touches) the axis there, but is generally nonzero elsewhere.

Spot the error

Each line contains a piece of plausible-sounding reasoning. Find where it breaks.

"To find the remainder of , I evaluate ."
Error — the value you plug in is the root of the divisor. gives , so you must evaluate , not .
" has the number in it, so I evaluate to get the remainder."
Error — solve first, giving ; the remainder is . The visible constant is not the root.
", but I can still divide by , so is a factor."
Error — you can divide anything, but "factor" demands remainder . Since , is not a factor.
" is a factor because the long division 'came out nicely'."
Error — "nice-looking" is not a criterion; the only criterion is a remainder of exactly (equivalently ). Verify the last line, not the vibe.
"If the remainder is a fraction like , I made a mistake — remainders should be whole numbers."
Error — polynomial remainders are just constants and can be any real number, including fractions; only integer division forces whole-number remainders.
" divided by makes no sense because we only allow real ."
Error — the theorem holds for complex too; here , so genuinely is a factor over the complex numbers.
"Since and are both factors, the polynomial must have degree exactly 2."
Error — it must have degree at least 2; a degree-3 or higher polynomial can carry both these factors plus others.

Why questions

Each answer is the reason, not a restatement of the fact.

Why do we substitute exactly in the proof, not some other value?
Because makes , which annihilates the entire term and leaves the equation reading — isolating the remainder cleanly.
Why must the remainder have degree less than the divisor?
If the remainder's degree equalled or exceeded the divisor's, you could divide once more and pull another term into the quotient — so a "true" remainder is what's left when no further division is possible.
Why is the Factor Theorem just a special case of the Remainder Theorem?
The Factor Theorem is the Remainder Theorem with the extra condition "remainder "; setting turns "remainder equals " into " divides evenly".
Why does testing small integer roots (like ) work so often when factoring?
The Rational Root Theorem says any rational root must divide the constant term, so small integer divisors of the constant are the natural first candidates to test with the Factor Theorem.
Why does the Remainder Theorem give a shortcut over Polynomial Long Division?
Long division computes both quotient and remainder step by step; if you only want the remainder, evaluating replaces the whole process with one substitution.
Why does the generalisation use for a divisor ?
Because at ; the remainder is always evaluated at the value that zeroes the divisor, whatever its coefficient.
Why can't appear as a factor of a nonzero constant polynomial?
A nonzero constant has degree ; a factor has degree , and you can't fit a degree-1 factor inside a degree-0 object — no root exists.

Edge cases

Boundary and degenerate inputs the theorem quietly still covers.

What is the remainder when is divided by ?
It is , which is simply the constant term of — dividing by reads off the value at zero.
If and ideas aside, can be a factor twice (a repeated root)?
Yes — if divides , then is a repeated root; alone confirms is a factor at least once, not how many times. ::: See Solving Polynomial Equations for multiplicity.
Is a factor of the zero polynomial ?
Yes, vacuously — for every , so every linear term "divides" the zero polynomial; the zero polynomial is a degenerate case.
If is a constant , what is the remainder on division by ?
The remainder is itself, since for all ; the quotient is and nothing gets divided out.
For a degree-1 polynomial like , what does the Factor Theorem give?
, so is a factor of itself with quotient — the smallest nontrivial case, confirming consistency.
By the Fundamental Theorem of Algebra, how many linear factors of the form can a degree- polynomial have (counting multiplicity)?
Exactly over the complex numbers — so the Factor Theorem, applied repeatedly, fully splits any polynomial into linear pieces. ::: Tools: Synthetic Division, Factoring Polynomials.
Can two different values both give the same remainder ?
Yes — a polynomial can take the same output at different inputs (e.g. a parabola), so equal remainders do not mean equal divisors.
Recall One-line summary of every trap here

Always plug in the root of the divisor (not the visible number), a factor requires remainder zero (not just "you can divide"), and the theorems hold even at the weird inputs — zero, constants, complex roots, and repeated factors.