Polynomial Remainder Theorem is the habit of evaluating polynomial remainders through substitution rather than long division. In contest math, that habit turns a crowded setup into a relation the student can test, bound, count, or compute. MathGrit teaches it as a recognizable signal, a deliberate move, and a final translation back to the original question.
A polynomial $P(x)$ leaves remainder $3$ when divided by $x - 1$ and remainder $5$ when divided by $x - 2$. Find the remainder when $P(x)$ is divided by $(x - 1)(x - 2)$.
1
Dividing by a quadratic gives a remainder of degree $< 2$, so write $R(x) = ax + b$ and $P(x) = (x-1)(x-2)Q(x) + ax + b$.
2
By the Remainder Theorem, $P(1) = 3$ and $P(2) = 5$. Substituting into the remainder: $a(1) + b = 3$ and $a(2) + b = 5$.
3
Subtract the equations: $a = 2$, then $b = 3 - 2 = 1$.
Answer:
Remainder $2x + 1$.
Olympiad / Challenge
Find the remainder when $x^{2024} + x^{1000} + 1$ is divided by $x^2 + x + 1$.
1
The roots of $x^2 + x + 1$ are the primitive cube roots of unity $\omega, \omega^2$, which satisfy $\omega^3 = 1$ and $\omega^2 + \omega + 1 = 0$.
2
Reduce exponents mod $3$: $2024 = 3(674) + 2$ so $\omega^{2024} = \omega^2$; and $1000 = 3(333) + 1$ so $\omega^{1000} = \omega$.
3
Thus $P(\omega) = \omega^2 + \omega + 1 = 0$ (and likewise $P(\omega^2) = 0$). A degree-$\le 1$ remainder $cx + d$ vanishing at both roots forces $c = d = 0$.
Answer:
Remainder $0$ (the quadratic divides the polynomial).
Going Deeper
Generalization: dividing by a degree-$d$ polynomial leaves a remainder of degree $< d$, determined by the values (or the value-and-derivative data, for repeated factors) of $P$ at the divisor's roots — evaluating at the roots is the multi-point version of 'plug in $x = c$'.
Where it appears: AMC quick remainder questions, AIME problems giving several remainder conditions and asking for the remainder mod a product (solve a small linear system for the coefficients), and reductions modulo $x^2 + x + 1$ or $x^2 + 1$ via roots of unity.
Pitfall: the simple 'plug in $x = c$' rule is ONLY for linear divisors $x - c$. For a higher-degree divisor you must posit a general remainder of the right degree and pin its coefficients using every root — assuming the remainder is a constant when dividing by a quadratic is a frequent error.
Spot the Signal
Look for problems where the key step is evaluating polynomial remainders through substitution rather than long division.
You can describe the hard part as evaluating polynomial remainders through substitution rather than long division, but a direct attack starts producing clutter.
The problem rewards preserving structure instead of expanding, listing, or guessing too early.
Learn the Move
Start by identify the expression or equation that calls for polynomial remainder theorem, then rewrite the givens around it.
Name the relation that makes Polynomial Remainder Theorem legal before doing computation.
Use the new relation to replace the messiest part of the problem with a cleaner one.
Translate the result back to the quantity the problem actually asks for.
Avoid These Traps
Do not use Polynomial Remainder Theorem just because the surface looks familiar; verify the required condition first.
Applying Polynomial Remainder Theorem because it sounds relevant, without checking the trigger first.
Stopping after spotting the technique instead of finishing the calculation or proof.
MathGrit Coach Note
Let polynomial remainder theorem reveal the algebraic structure; then compute only what remains.
Try it on:
Practice a contest problem where the key step is evaluating polynomial remainders through substitution rather than long division.