Using the Rational Root Theorem to Find Possible Rational Zeros

Good to see you again. In the previous lesson, you learned to reveal a polynomial’s structure by factoring in quadratic form. That skill remains important here: before using a new theorem, always look for an available GCF or familiar factoring pattern.

This lesson introduces the Rational Root Theorem (also called the Rational Zero Theorem). Its purpose is deliberately limited but powerful: it produces a complete, finite list of numbers that contain every possible rational zero of a polynomial with integer coefficients. It does not say every number on the list is actually a zero; testing candidates comes next, using synthetic division.

By the end, you should be able to identify the leading coefficient and constant term, construct the candidate list $\pm \frac{p}{q}$, simplify it, and remove duplicates reliably.

---

What the theorem says—and what it does not say

A zero (or root) of a polynomial $P(x)$ is a number $r$ for which

$$P(r)=0.$$

Equivalently, if $r$ is a zero, then $x-r$ is a factor of $P(x)$.

The Rational Root Theorem applies to a polynomial in standard form with integer coefficients:

$$P(x)=a_n{x}^n+a_{n-1}{x}^{n-1}+\cdots +a_{1}x+a_0.$$

Here:

• $a_n$ is the leading coefficient;
• $a_0$ is the constant term.

The theorem states:

If $r$ is a rational zero of $P(x)$, written in lowest terms as

$$r=\frac{p}{q},$$

then $p$ must be a factor of the constant term $a_0$, and $q$ must be a factor of the leading coefficient $a_n$.

In candidate-list notation:

$$\boxed{\text{Possible rational zeros}=\pm \frac{\text{factors of constant term}}{\text{factors of leading coefficient}}}$$

There is an important logical direction here:

$$\text{rational zero}⟹\text{appears on the candidate list}.$$

But the converse is not guaranteed:

$$\text{appears on the candidate list}\text{centernot}⟹\text{is actually a zero}.$$

For example, a candidate list might contain twelve numbers even though the polynomial has only one rational zero—or none at all.

---

The reliable procedure

Before beginning, make two quick checks:

1. Put the polynomial in standard form, with powers decreasing.
2. Factor out a GCF first if one exists. This maintains the factoring habits developed earlier and usually makes the numbers easier to manage.

Then use the following workflow.

Step	Action
1	Identify the constant term $a_0$.
2	List its positive factors; call these possible numerators $p$.
3	Identify the leading coefficient $a_n$.
4	List its positive factors; call these possible denominators $q$.
5	Form every reduced fraction $\frac{p}{q}$.
6	Include both signs, writing $\pm$ once for each distinct positive value.
7	Remove duplicates. The result is the complete candidate list.

Using positive factors in Steps 2 and 4 keeps the bookkeeping clean. The $\pm$ in Step 6 supplies both positive and negative possibilities.

For instance, if the constant term is $-12$, use the positive factors

$$1,2,3,4,6,12.$$

The negative sign on the constant does not require a separate factor list: adding $\pm$ to the final answers already accounts for it.

Similarly, if the leading coefficient is $-6$, use the positive factors of $6$:

$$1,2,3,6.$$

A denominator is conventionally positive, so its sign does not need separate treatment.

---

A full example: making and simplifying the list

Consider

$$g(x)=4x^5-3x^4+8x^3+2x^2-5x+12.$$

The polynomial is in standard form. Its:

$$\text{constant term}=12,$$ $$\text{leading coefficient}=4.$$

List the positive factors of each:

$$p:1,2,3,4,6,12,$$ $$q:1,2,4.$$

Now form every possible quotient $\frac{p}{q}$. Rather than writing every signed quotient immediately, first make a clean list of the distinct positive values.

Using $q=1$ gives

$$1,2,3,4,6,12.$$

Using $q=2$ gives

$$\frac{1}{2},1,\frac{3}{2},2,3,6.$$

The values $1,2,3,$ and $6$ are duplicates, so the only new values are

$$\frac{1}{2},\frac{3}{2}.$$

Using $q=4$ gives

$$\frac{1}{4},\frac{1}{2},\frac{3}{4},1,\frac{3}{2},3.$$

This contributes two more new values:

$$\frac{1}{4},\frac{3}{4}.$$

Therefore the complete candidate list is

$$\boxed{\pm 1,\pm 2,\pm 3,\pm 4,\pm 6,\pm 12,\pm \frac{1}{2},\pm \frac{3}{2},\pm \frac{1}{4},\pm \frac{3}{4}}.$$

The order does not matter. A clean organization, however, helps prevent two common errors:

• omitting a fraction such as $\frac{3}{4}$;
• leaving unreduced duplicates such as $\frac{2}{4}$, which is already $\frac{1}{2}$.

Notice what has not happened: we have not substituted any of these values into $g(x)$. At this stage, they are possibilities only.

---

A shorter example: when the leading coefficient is prime

Let

$$P(x)=3x^3-2x^2+7x-6.$$

The constant term is $-6$, so the positive factors of its magnitude are

$$1,2,3,6.$$

The leading coefficient is $3$, whose positive factors are

$$1,3.$$

Build fractions:

$$\frac{1}{1},\frac{2}{1},\frac{3}{1},\frac{6}{1},$$

and

$$\frac{1}{3},\frac{2}{3},\frac{3}{3},\frac{6}{3}.$$

Reduce:

$$\frac{3}{3}=1,$$ $$\frac{6}{3}=2.$$

Those are duplicates. Thus the possible rational zeros are

$$\boxed{\pm 1,\pm 2,\pm 3,\pm 6,\pm \frac{1}{3},\pm \frac{2}{3}}.$$

A useful count check is available before simplification. There are four choices for $p$ and two choices for $q$, so there should initially be

$$4\cdot 2=8$$

positive quotients before duplicates are removed. In this example, two of the eight reduce to values already present.

---

Special cases worth handling correctly

When the leading coefficient is $1$

If the polynomial is monic, meaning its leading coefficient is $1$, then the only denominator factor is $1$. The possible rational zeros are simply the signed factors of the constant term.

For

$$f(x)=x^4-5x^3+2x-18,$$

the constant term is $-18$, and the leading coefficient is $1$. Therefore:

$$\boxed{\pm 1,\pm 2,\pm 3,\pm 6,\pm 9,\pm 18}.$$

No non-integer fractions can appear on the list, because every candidate has denominator $1$.

When the polynomial has a GCF

Consider

$$6x^3+18x^2-24x.$$

Do not start by treating $0$ as an ordinary constant term in the theorem. First factor:

$$6x^3+18x^2-24x=6x(x^2+3x-4).$$

This immediately reveals one zero:

$$x=0.$$

For any remaining nonzero rational zeros, work with the quotient

$$x^2+3x-4.$$

The broader factoring principle is unchanged: factor first, then use the theorem only where it is useful.

When familiar factoring works already

If a polynomial factors readily by grouping, quadratic form, difference of squares, or another method, use that method first. The Rational Root Theorem is most useful when a polynomial does not yield to those visual structures.

For example,

$$x^3-4x^2-x+4$$

can be factored by grouping:

$$x^2(x-4)-1(x-4)=(x^2-1)(x-4).$$

There is no need to generate rational-zero candidates before noticing this structure.

---

Why the theorem must be true

The theorem can initially feel like a pattern to memorize: “constant factors over leading-coefficient factors.” But it rests on a direct divisibility argument.

Suppose $r=\frac{p}{q}$ is a rational zero of

$$P(x)=a_n{x}^n+a_{n-1}{x}^{n-1}+\cdots +a_{1}x+a_0,$$

where the coefficients are integers and $\frac{p}{q}$ is in lowest terms. Thus,

$$\gcd (p,q)=1.$$

Because $r$ is a zero,

$$P\left(\frac{p}{q}\right)=0.$$

Substituting gives

$$a_n{\left(\frac{p}{q}\right)}^n+a_{n-1}{\left(\frac{p}{q}\right)}^{n-1}+\cdots +a_1\left(\frac{p}{q}\right)+a_0=0.$$

Multiply the entire equation by $q^n$ to clear denominators:

$$a_n{p}^n+a_{n-1}{p}^{n-1}q+\cdots +a_{1}p{q}^{n-1}+a_0{q}^n=0.$$

Now isolate the first term:

$$a_n{p}^n=-q\left(a_{n-1}{p}^{n-1}+\cdots +a_{1}p{q}^{n-2}+a_0{q}^{n-1}\right).$$

The right side is divisible by $q$, so $q$ divides $a_n{p}^n$. But $p$ and $q$ have no common factor, which means $q$ also shares no factor with $p^n$. Therefore, the factor $q$ must divide $a_n$, the leading coefficient.

A symmetric rearrangement isolates the constant term:

$$a_0{q}^n=-p\left(a_n{p}^{n-1}+a_{n-1}{p}^{n-2}q+\cdots +a_1{q}^{n-1}\right).$$

Thus $p$ divides $a_0{q}^n$. Since $p$ and $q$ share no common factor, $p$ must divide $a_0$, the constant term.

That is exactly the theorem’s conclusion:

$$p\mid a_0\text{and}q\mid a_n.$$

---

A final checklist

When asked to list possible rational zeros, use this compact checklist:

• Is the polynomial in standard form?
• Can I factor out a GCF first?
• What is the constant term?
• What is the leading coefficient?
• Have I listed all positive factors of each?
• Have I formed every $\frac{p}{q}$ combination?
• Have I reduced fractions and removed duplicates?
• Have I included both signs?
• Have I avoided claiming that every candidate is a genuine zero?

The key distinction is worth retaining:

$$\boxed{\text{The Rational Root Theorem gives candidates, not answers.}}$$

Next, you will use synthetic division to test candidates efficiently. A remainder of zero will turn a possible rational zero into a confirmed zero and expose a corresponding factor of the polynomial.