The Solution
Calculation: Remainder Theorem Calculator
Remainder Theorem Calculator
Enter your polynomial coefficients above and click "Evaluate f(c)" to see results.Graph will appear here after you solve.
Cubic Equation Solver
Remainder Theorem solver
Find real and complex roots, discriminant, and cubic graphs in seconds with our precision solver.
The Equation
Enter your cubic's coefficients and an evaluation point c to instantly compute the remainder f(c).
f(x) = 0 = 0
The Treatise
What isRemainder Theorem Calculator?
- For a school student: The remainder theorem finds the leftover of a polynomial division without doing the division. Just as you can know the remainder of 17 ÷ 5 is 2 without long dividing, you can know the remainder of a polynomial divided by (x − c) by simply plugging c in. One substitution replaces a page of work.
- For a college student: Dividing P(x) by (x − c) leaves a constant remainder equal to P(c). That is the whole theorem: P(x) = (x − c)Q(x) + P(c). When the remainder is zero, (x − c) is a factor, which is the factor theorem as an immediate corollary.
- For the advanced reader: Evaluation at c is a ring homomorphism from F[x] onto F whose kernel is exactly the principal ideal (x − c). The remainder theorem is the first isomorphism theorem in disguise, and it generalizes: dividing by (ax − b) leaves remainder P(b/a).
- Why it matters in practice: Testing a root candidate takes one evaluation instead of a division. Generate candidates with the rational root theorem, test each here or with synthetic division, and every zero becomes a factor for the factorization calculator. For non-linear divisors, use long division.
The Formula
Formula / Method
- General form: P(x) = (x − c)Q(x) + P(c). The remainder of division by (x − c) is the value P(c).
- Shortcut: Synthetic division with the same c produces P(c) as its final entry, which is convenient for high-degree polynomials where direct substitution is tedious.
- Reading the result: A zero remainder means (x − c) divides P(x) exactly, so c is a root. Any other value is simply the remainder, still useful for checks.
- A common trap: The divisor must read as (x − c). For (x + 5) the value to plug in is c = −5, not 5.
The Method
How To Use
- Step 1. Enter the polynomial's coefficients in descending order.
- Step 2. Enter c, the number from the divisor (x − c), minding the sign.
- Step 3. Press "Calculate". The tool evaluates P(c) and shows the working.
- Step 4. Interpret the value: it is the remainder, and zero means you have found a factor, ready for the factorization calculator.
Key Features
- Evaluates P(c) instantly with no division required.
- Shows the synthetic tableau alongside as a step-by-step proof.
- Flags zero remainders immediately as discovered factors.
- Works for polynomials of any degree, not just cubics.
- Hands zero-remainder cases directly to factorization.
The Illustration
Visual Diagram
Example Concept
Let P(x) = x³ − 6x² + 11x − 6. Remainder on division by (x − 2):
P(2) = 8 − 24 + 22 − 6 = 0. Zero remainder, so (x − 2) is a factor.
Remainder on division by (x − 4): P(4) = 64 − 96 + 44 − 6 = 6. Cross-check with synthetic division at c = 4: coefficients 1, −6, 11, −6 give the cascade 1 → 4 → −2 → −8 → 3 → 12 → 6, and the final 6 matches.
The Deep Dive
Interactive Deep Dive
The proof runs through the division algorithm: P(x) = (x − c)Q(x) + R where deg R < 1, so R is a constant. Substituting x = c annihilates the first term entirely, leaving R = P(c). The degree restriction is doing all the work here: because the divisor is linear, the remainder has nowhere to hide except in a single number, and evaluation finds it. Uniqueness of the quotient-remainder pair guarantees no other answer is possible.
The factor theorem drops out for free: a zero remainder means exact division, so P(c) = 0 holds exactly when (x − c) is a factor. Two famous theorems, one proof. This equivalence is the beating heart of the factorization calculator: every factor it reports was certified by a zero remainder, every zero remainder it finds becomes a factor, and the chain continues until the polynomial is fully broken down.
The map P ↦ P(c) respects addition and multiplication, making it a ring homomorphism from F[x] onto F. Its kernel, the set of polynomials it sends to zero, is precisely the multiples of (x − c). This abstract viewpoint explains why "plugging in" is always legitimate inside formulas: evaluation commutes with every algebraic operation you might perform first, from addition to composition.
Nothing in the proof required a cubic, or even a low degree: the theorem holds for polynomials of every degree and over every coefficient field. It also powers randomized polynomial identity testing, where evaluating at random points exposes unequal polynomials with high probability. With care it extends to matrix polynomials too: for a square matrix C, dividing P(x) by (xI − C) leaves the matrix remainder P(C), a fact behind the Cayley-Hamilton theorem.
The (x + c) trap generalizes cleanly. Dividing by (ax − b) leaves remainder P(b/a): solve the divisor equal to zero for x first, then evaluate there. For (2x − 6) the test point is x = 3. For genuinely higher-degree divisors the remainder can itself be a polynomial, and that case belongs to long division.
The Applications
Real-World Applications
🔎
Quick Polynomial Evaluation
Need P(7) for a degree-8 polynomial? One substitution beats expanding eight terms individually. The theorem turns every evaluation question into a remainder question and back, which is why it doubles as the fastest mental-math route to polynomial values.
📝
Root Verification
Suspect x = 2 is a root? A zero remainder confirms it without any division tableau. Candidate testing from the rational root theorem becomes a sequence of quick evaluations, each one a pass/fail verdict in a single line.
🎓
Teaching Tool
The theorem is many students' first encounter with the idea that division and evaluation are two faces of one coin. Demonstrating it live, with the tableau beside the substitution, makes the abstraction concrete and memorable.
⚡
Arithmetic Debugging
Evaluating P(c) two ways, by substitution and by synthetic division, catches sign slips fast. When both routes agree, the computation is almost certainly correct. Make this a habit on exams: thirty seconds of cross-checking saves the whole problem.
🎨
Identity Checksums
Like casting out nines for arithmetic, evaluating both sides of a polynomial identity at a test point verifies it instantly. Cross-check factorizations against Vieta's relations the same way.
The Cautions
Common Mistakes to Avoid
MISTAKE Nº 1
Confusing (x+c) with (x−c): The divisor (x + 5) corresponds to c = -5. Solve divisor = 0 for x first, every time, and the sign takes care of itself.
MISTAKE Nº 2
Forgetting it works for ANY polynomial: Degree is irrelevant to the theorem. It applies to quadratics, degree-20 monsters, and everything between.
MISTAKE Nº 3
Mixing up division and evaluation: The theorem replaces division with evaluation. If you find yourself doing long division to find the remainder, you have missed the point.
MISTAKE Nº 4
Applying it to nonlinear divisors: The theorem needs a divisor of the form (x - c). For (x² + 1) or higher, the remainder is a polynomial, not a number.
MISTAKE Nº 5
Sign slips with negative c: Evaluating P(-3) means substituting -3 for every x, minding double negatives like -(-3)². Write each substitution explicitly.
The Reference
Quick Reference Table
Quick Reference TableREF
Theoremf(x) ÷ (x−c) has remainder f(c)
Factor Testf(c) = 0 means (x−c) is a factor
MethodUse synthetic division for efficiency
Works ForPolynomials of any degree
Key BenefitAvoids computing large powers directly
The Collection
Explore Related Tools
The Questions
Frequently Asked Questions
What is the remainder theorem in one sentence? +
Dividing P(x) by (x - c) leaves remainder P(c): just plug c in. No division tableau required unless you also want the quotient.
How is it different from the factor theorem? +
The factor theorem is the special case where the remainder is zero. Zero remainder means (x - c) is a factor; see the factorization calculator. Any other remainder is just a number, still useful for verification.
Can c be a fraction? +
Yes. P(1/2) is the remainder on division by (x - 1/2), no special handling needed. Fractions, negatives, and irrationals all work the same way.
Does it work for degree 10? +
Any degree. The proof never uses the degree except to guarantee the division terminates, so degree-50 polynomials obey it exactly like cubics do.
Why not just do the division? +
Plugging in is O(n) writing versus a full tableau. Same number, far less work, which is why the theorem exists. Reserve the tableau for when you also need the quotient coefficients.
What if the divisor is (2x - 4)? +
The remainder is P(2). Always solve divisor = 0 for x first, then evaluate there. For (2x - 4), x = 2, so one substitution gives the remainder with no division at all.
Can the remainder be a polynomial? +
Only when the divisor has degree 2 or higher. That case belongs to our long division calculator, which handles the full quotient-plus-remainder computation step by step.
How do I hunt for roots with it? +
Generate candidates with the rational root theorem, then test each c for P(c) = 0. Every hit is a root, and the synthetic division tableau for that c doubles as the deflation step.