Across the techniques above, four core methods cover the great majority of root-finding problems. Each has a sweet spot — a class of polynomials it handles best — and a limitation that hands the job to the next method. The table below collects them with the situation each applies to, what it produces, and where it stops.
| Method |
When it applies |
What it produces |
Limitation |
| Factoring |
polynomial factors cleanly over the integers |
all roots directly readable from the factors |
not every polynomial factors over the integers |
| Quadratic formula |
degree 2 polynomial (or a quadratic factor) |
both roots exactly (real or complex) |
degree 2 only |
| Rational Root Theorem |
polynomial with integer coefficients, any degree |
finite candidate list ± p ⁄ q to test for rational roots |
misses irrational and complex roots |
| Synthetic division |
testing a candidate root and reducing degree |
remainder (= P(r)) and reduced quotient in one pass |
requires a candidate; chains best with RRT |