Chapter 3 — Polynomials and Rational Functions
3.2 — Real Zeros of Polynomials
Every root is, first of all, a factor that has not yet been extracted.
§1.3 taught us to factor by inspection: recognize a common factor, group terms, identify a special product, solve a quadratic trinomial. Those techniques suffice for the cases we treated there, but none of them says what to do in front of . No common factor simplifies it, no special product recognizes it, and its degree exceeds what the general formula solves. We need a more general tool, and that tool is division.
§1. The division algorithm
Section titled “§1. The division algorithm”Polynomial division answers the same question as integer division: given a dividend and a divisor, what quotient and remainder result? The answer has the same structure and the same guarantee of uniqueness.
Theorem (division algorithm). Let and be polynomials with real coefficients, with nonzero. There exist unique polynomials and such that
We call the quotient and the remainder.
Proof. Existence. We proceed by strong induction on the degree of . If or , we take and , and the condition holds trivially. For the inductive step, suppose and that the theorem holds for every polynomial of degree less than , and also for the zero polynomial. Let be the leading coefficient of and that of . Consider
which is constructed to cancel the term of degree : its coefficient of is , and no term of or of has degree greater than . Therefore is the zero polynomial or has degree less than . By the inductive hypothesis there exist and with and or . Substituting,
which is the desired form, with .
Uniqueness. Suppose that , with both remainders zero or of degree less than . Subtracting,
If , the left side is a product of nonzero polynomials and, by §1.3 §2, has degree . The right side, on the other hand, is zero or has degree less than , being the difference of two polynomials of that kind. This is a contradiction. Hence , and then .
The proof describes a procedure: cancel the term of highest degree, subtract, and repeat on the partial remainder until its degree falls below that of . This is long division of polynomials, the same mechanics as long division of integers.
When the divisor is , the procedure simplifies and is called synthetic division. Let us see why. If and we look for with constant, expanding the product and comparing the coefficients of each power we obtain
At each step, then, the previous coefficient of the quotient is multiplied by and added to the next coefficient of . It is the same algorithm as in the theorem, specialized to .
§2. The Remainder Theorem and the Factor Theorem
Section titled “§2. The Remainder Theorem and the Factor Theorem”The final observation of §1, that dividing by leaves a constant remainder, has a consequence that is not evident at first sight: that remainder can be computed without dividing.
Theorem (Remainder). If is divided by , the remainder is .
Proof. By §1, with constant. This equality between polynomials holds for every value of , because adding and multiplying polynomials is nothing more than applying distributivity, and those operations give the same values when evaluated. Evaluating at :
The theorem turns a question about division, what is the remainder?, into one of simple evaluation. And it immediately isolates the case in which that remainder vanishes.
Theorem (Factor). The number is a root of if and only if divides exactly, that is, with remainder .
Proof. By the Remainder Theorem, the remainder of dividing by is . This remainder is exactly when , that is, exactly when is a root of .
This is the result that §1.3 left pending. There, factoring a quadratic trinomial meant finding its two roots with the general formula and writing . The Factor Theorem generalizes that procedure to any degree and does not need a general formula. In fact, for degree five or higher there is no general formula in radicals, a theorem we do not prove here. It is enough to locate a root by other means: division by yields the rest of the factorization, of degree one less, and on that quotient we can repeat the process.
That repetition lets us settle the pending matter of §3.1: that every zero has a multiplicity.
Corollary. Every zero of a nonzero polynomial has a multiplicity (in the sense of §3.1 §3), and .
Proof. By the Factor Theorem, with . If , we are done with . If , we apply the theorem again to and obtain , of degree . Each step lowers the degree by one and a nonzero polynomial has degree at least , so the process stops at some step , when the quotient satisfies (a nonzero constant polynomial satisfies this). Then with .
§3. The Rational Root Theorem
Section titled “§3. The Rational Root Theorem”The Factor Theorem solves the problem of checking whether a given number is a root, but it does not say where to get that candidate. When the coefficients of are integers, we can bound in advance the set of rational candidates.
The proof uses a fact about integers that is worth making explicit. We say that two integers are coprime if they have no common divisors greater than .
Lemma. Let be integers, with coprime to . Then is coprime to for every , and if divides , then divides .
Proof. We use Bézout’s identity, a basic property of the integers that we accept without proof: two integers are coprime if and only if there exist integers with . If is coprime to and to , with and , multiplying both equalities we obtain
so is coprime to . Applying this repeatedly with , we obtain that is coprime to . For the second claim, if and divides , then is a sum of two multiples of , and therefore divides .
Theorem (Rational Root). Let with all and . If is a rational root of , written in lowest terms (, , and coprime), then divides and divides .
Proof. Suppose :
Multiplying both sides by and moving to the other side,
The right side is an integer multiple of , so divides . Since is coprime to , the lemma gives that divides . From the same equality, moving now to the other side, we obtain . This says that divides , and since is coprime to , the lemma gives that divides .
The theorem does not guarantee that any of those candidates is a root, nor even that has any rational root. What it provides is a finite, computable list of candidates, on which we apply the Factor Theorem by direct verification.
Let us do so with the polynomial from the beginning, . Since the leading coefficient is , the candidates are the divisors of , with both signs. We try : . By the Remainder Theorem, dividing by leaves remainder , so is not a root. We try : , so divides . Synthetic division by (with ) on the coefficients gives successively ; ; ; ; and the remainder . Therefore
We repeat the process with the quotient. The candidates are still divisors of , and gives . Synthetic division with on gives ; ; ; and the remainder . The quotient is , which §1.3 factors by looking for two numbers with product and sum : they are and . In total,
and the real zeros of are , , and , all of multiplicity .
§4. Bounding the number of real zeros
Section titled “§4. Bounding the number of real zeros”One last structural question remains, which §3.1 touched on when speaking of multiplicity without specifying how many zeros a polynomial can have in total. To count them with multiplicity we need to know how the multiplicity changes when we divide by a linear factor. We write for the multiplicity of as a zero of , with if .
Lemma. Let with nonzero. Then , and for every .
Proof. Let , so that with . Then , and by the uniqueness of §3.1 §3, . If and , we write with . Then , and the bracket equals at , because it is a product of two nonzero numbers. By the same uniqueness, .
Proposition. A polynomial of degree has finitely many real zeros, and the sum of their multiplicities is at most .
Proof. By induction on . If , with has exactly one zero, , of multiplicity : the proposition holds. Suppose the result valid for every degree less than and let . If has no real zeros, the sum is . If is a zero, the Factor Theorem gives with . By the lemma, the zeros of are together with the zeros of , and the sum of multiplicities of is that of plus one. If , the inductive hypothesis says that the sum for is at most ; if , is a nonzero constant and has no zeros, with sum . In both cases the sum for is at most .
This bound is not, in general, an equality: nothing guarantees that zeros exist, nor even a single one. The simplest case already shows it: has degree , but no real satisfies , the same impossibility that §1.3 pointed out for the sum of squares and that §1.2 established for the even root of a negative number. The bound of this section says how many real zeros a polynomial can have at most; it does not say what happens with the ones that are missing.
The tools of this section, division, the Factor Theorem, the Rational Root Theorem and the bound by the degree, completely solve the problem of finding the real zeros of a polynomial when they exist. But the question with which we closed §4 was deliberately left unanswered: what are the roots that lacks in ? Answering it requires extending the number system itself, and that is the subject of the next section.
Copyright © 2026 Carlos Dagorret — Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)