Rational Zeros Calculator

What the rational zeros theorem states

The rational zeros theorem gives a short list of fractions that could possibly be a zero of a polynomial with whole number coefficients. It does not claim every number on the list is a zero. It claims that if a polynomial has a rational zero at all, that zero must appear somewhere on the list. That turns a search over every fraction into a search over a small, finite set you can write down in seconds.

Suppose P(x) = aₙxⁿ + ... + a₁x + a₀, where every coefficient is an integer and aₙ is not zero. The theorem says any rational zero, written in lowest terms as p/q, must satisfy two conditions. The numerator p must divide the constant term a₀. The denominator q must divide the leading coefficient aₙ. Because q can be greater than 1, the candidates include fractions, not only whole numbers, which is the part students most often miss.

The theorem is a filter, not a finder. It shrinks the field of candidates so synthetic division has only a handful of numbers to test. After you test them, the ones that give a remainder of zero are the actual rational zeros. Any zero that is not on the list, such as the square root of two or an irrational root from the quadratic formula, shows that the polynomial has real zeros the theorem never claimed to find.

Building the candidate list by hand

To build the list, start with the constant term. Write down every positive integer that divides it evenly, including 1 and the number itself. Do the same for the leading coefficient. Then form every fraction p/q where p comes from the constant term list and q comes from the leading coefficient list, keep each fraction only once after reducing, and attach both a plus and a minus sign.

Take the example 2x³ − 3x² − 11x + 6. The constant term is 6, whose positive divisors are 1, 2, 3 and 6. The leading coefficient is 2, whose positive divisors are 1 and 2. Pairing them gives the fractions 1, 1/2, 2, 3, 3/2 and 6 after duplicates are removed, and the full candidate list is each of these with a plus or minus sign.

Notice the list has 12 entries, not 24, because reducing fractions removes duplicates. The pairs 2/1 and 6/2 both simplify to 2, so 2 is written once, and 3/1 and 6/2 collapse the same way. Reducing first keeps the list honest and short, and the calculator does this automatically so you never double count.

Worked example: all zeros of 2x³ − 3x² − 11x + 6

With the 12 candidates in hand, test each one by plugging it into the polynomial. A candidate is a true zero when the result is exactly zero. You can test in any order, but starting with the whole numbers is fast because they avoid fractions.

Three candidates survive: x = −2, x = 1/2 and x = 3. Because the polynomial is degree 3, finding three rational zeros means we have found every zero. Writing the factors, the polynomial equals (x + 2)(2x − 1)(x − 3), which you can check by multiplying back to 2x³ − 3x² − 11x + 6.

The order of testing does not change the answer. Some people test positives first, others test in order of size. What matters is that each candidate is checked with exact arithmetic, so a fraction that lands on zero is not rounded away by a calculator display.

Synthetic division confirms each zero and lowers the degree

Synthetic division is the fast way to check a candidate and, at the same time, produce a shorter polynomial to keep working with. Write the coefficients across the top, bring the first one straight down, then multiply by the candidate and add into the next column. A remainder of zero at the end means the candidate is a zero.

After dividing out x = 3 you get 2x² + 3x − 2. Dividing that by x = −2 gives 2x − 1, and the last factor 2x − 1 = 0 returns x = 1/2, the third zero. Each synthetic division that ends in zero is a double confirmation: the number is a zero and the degree drops by one, so the search gets shorter.

When the polynomial still has degree 2 after you have pulled out every rational zero, switch to the quadratic formula. The remaining two zeros may be irrational or complex, and the theorem alone will not name them. That is normal, not a sign you made an error.

When the candidate list finds nothing

A polynomial can pass the candidate test and still have no rational zeros. Consider x³ − 2x − 5. The constant term is −5, so p is 1 or 5, and the leading coefficient is 1, so q is 1, giving candidates +1, −1, +5 and −5. Testing all four: f(1) = −6, f(−1) = −4, f(5) = 110 and f(−5) = −120, none zero.

The absence of a rational zero does not mean the polynomial has no zeros. x³ − 2x − 5 has one real zero near x = 2.0946 and two complex zeros, which the rational zeros theorem cannot expose. This is the classic example used to show that some cubic equations with integer coefficients resist rational roots entirely.

The practical lesson is to treat a failed list as information, not a dead end. If no candidate works, stop hunting for rational zeros, report that none exist, and reach for numeric methods or the quadratic formula for whatever degree remains. The calculator makes this explicit by listing zero confirmed zeros and pointing you to the next step.

How long the list gets and when to stop

The length of the candidate list grows with the number of divisors of the constant term and the leading coefficient. If the constant term has D1 positive divisors and the leading coefficient has D2, the raw count before reducing is 2 times D1 times D2, and reducing fractions can only make it smaller. The example 2x³ − 3x² − 11x + 6 had D1 = 4 and D2 = 2, for a raw 16 that reduced to 12 after removing duplicates.

You can stop the search early in two ways. First, when the number of confirmed rational zeros equals the degree, you are done, because a degree n polynomial has at most n zeros. Second, once the remaining polynomial drops to degree 2, the quadratic formula finishes the job, so any further candidate testing is wasted.

A common slip is to test a candidate once and move on without checking for multiplicity. If a zero appears twice, synthetic division by that number leaves it as a zero of the new quotient, so test it again on the shorter polynomial. The calculator repeats each confirmed zero on the depressed polynomial so double roots are not missed.

Using the calculator and what it cannot do

Enter the coefficients from highest power of x down to the constant, leaving blank any power that is missing. The calculator reads whole numbers only, lists the reduced candidates, tests each one with exact integer arithmetic, and reports the confirmed rational zeros together with the synthetic division that produced them. It also factors out x automatically when the constant term is zero.

The calculator does not perform symbolic factorization of irrational or complex zeros, and it does not solve degree 2 remainders. When it hands back a quadratic leftover, treat that as the cue to apply the quadratic formula yourself. It is a rational zeros engine, not a full polynomial solver, and it says so in the output so you know where its job ends.

Because the arithmetic is exact, the calculator will not round a true zero into a near miss. A fraction such as 3/2 is checked by clearing denominators and comparing a single integer to zero, so the answer is either a confirmed zero or not, with no tolerance that could let a wrong number slip through.

Where the theorem sits in the algebra course

The rational zeros theorem sits in the polynomial chapter of a first algebra course, right after factoring and long division and just before the fundamental theorem of algebra. It is the bridge that lets students find exact zeros of cubics and quartics without guessing, and it appears on most algebra finals and placement exams.

For a full, worked treatment with more examples, Paul's Online Notes from Lamar University walks through the listing and testing process step by step, and OpenStax College Algebra 2e covers the same method in its zeros of polynomial functions chapter. Both are free, and both use the exact rule that p divides a₀ and q divides aₙ.