Remainder Theorem
The remainder theorem states that when a polynomial P(x) is divided by (x − a), the remainder is simply P(a) — no long division needed. To divide by a linear factor of the form (bx − c), evaluate P at x = c/b. The theorem is the workhorse for "find the remainder" questions in both algebra and number theory, because a large number written in a base can be read as a polynomial in that base. For instance, the remainder when a number is divided by 9 equals the digit sum reduced mod 9, which is exactly P(1) mod 9 with x as the base. In CAT, watch for two layers: a direct evaluation, or a "find the remainder, then use it" set-up where the remainder feeds a second equation. When two remainders are given for two divisors, you usually get two equations P(a₁) = r₁ and P(a₂) = r₂ to solve simultaneously.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Algebraic identities
| Square of a sum/difference | (a ± b)² = a² ± 2ab + b² |
|---|---|
| Difference of squares | a² − b² = (a − b)(a + b) |
| Cube of a sum/difference | (a ± b)³ = a³ ± 3a²b + 3ab² ± b³ |
| Sum/difference of cubes | a³ ± b³ = (a ± b)(a² ∓ ab + b²) |
| Three-cube identity | a³ + b³ + c³ − 3abc = (a + b + c)(a² + b² + c² − ab − bc − ca) |
| Square of a trinomial | (a + b + c)² = a² + b² + c² + 2(ab + bc + ca) |
Division & roots tools
| Remainder theorem | Remainder of P(x) ÷ (x − a) is P(a) |
|---|---|
| Factor theorem | (x − a) divides P(x) ⇔ P(a) = 0 |
| Vieta — quadratic ax²+bx+c | sum = −b/a, product = c/a |
| Vieta — cubic ax³+bx²+cx+d | Σα = −b/a, Σαβ = c/a, αβγ = −d/a |
| Sum of squares of roots | Σα² = (Σα)² − 2Σαβ |
| When a+b+c = 0 | a³ + b³ + c³ = 3abc |