Zeroes of a polynomial

Every polynomial hides a set of special inputs — numbers that, when substituted for the variable, make the whole expression collapse to zero. These are its zeroes, and finding them is one of the central skills of algebra, because a zero of p(x)p(x) tells you exactly where the polynomial's graph touches the x-axis and exactly which linear expression divides it evenly. This article builds on "Polynomials in one variable" from the CBSE Class 9 chapter Polynomials. You already know how to write and evaluate a polynomial p(x)p(x) at a chosen value; here that skill is sharpened into a test for zeroes, extended to prove the Remainder Theorem — a shortcut that finds a division remainder without doing any long division — and practised on both linear and quadratic examples. Sum/product-of-zeroes formulas for quadratics and graphical root-finding stay out of scope; they belong to Class 10 and to coordinate geometry.

The core insight

A real number kk is a zero of the polynomial p(x)p(x) exactly when p(k)=0p(k) = 0, and the Remainder Theorem turns the search for zeroes into simple substitution: dividing p(x)p(x) by (x−a)(x-a) always leaves remainder p(a)p(a).

The core idea

Evaluating a polynomial. If p(x)p(x) is a polynomial in xx and kk is any real number, replacing every xx in p(x)p(x) with kk gives a single number, written p(k)p(k) and called the value of p(x)p(x) at x=kx = k. This is nothing more than substitution, but it is the operation everything else in this topic is built on.

Definition of a zero. A real number kk is called a zero of p(x)p(x) if substituting it makes the polynomial vanish:

p(k)=0.p(k) = 0.

where: p(x)p(x) is the polynomial, kk is the candidate value being tested, and p(k)p(k) is the number you get after substitution — a zero is any kk for which that number is exactly 00.

Zero of a linear polynomial. For p(x)=ax+bp(x) = ax + b with a≠0a \neq 0, setting p(x)=0p(x) = 0 and solving for xx gives

ax+b=0⟹x=−ba.ax + b = 0 \quad\Longrightarrow\quad x = -\frac{b}{a}.

where: aa is the coefficient of xx (never zero, or the polynomial would not be linear), bb is the constant term, and x=−b/ax = -b/a is the unique solution. Every linear polynomial has exactly one zero — no more, no fewer — because this equation has exactly one solution.

Not every polynomial has a real zero at all. Take p(x)=x2+1p(x) = x^2 + 1. For any real kk, p(k)=k2+1≥1p(k) = k^2 + 1 \geq 1, which never touches 00. So "find the zero" can legitimately have the answer "there is no real zero" — a point students often miss, expecting every polynomial to hand them a number.

More than one zero is possible. A quadratic polynomial can have up to two zeroes (verified in the worked example below with p(x)=x2−x−2p(x) = x^2 - x - 2, which has zeroes 22 and −1-1), a cubic up to three, and so on — a degree-nn polynomial has at most nn zeroes.

Figure
A number line showing a polynomial graph crossing the x axis at two marked zero points
Zeroes are where the graph meets the x axis x p(x) x = -1 x = 2 p(x) = x squared minus x minus 2 touches zero at x = -1 and x = 2
Derivation AThe Remainder Theorem

The goal is to show, using only the division algorithm every student already knows for numbers, that dividing any polynomial p(x)p(x) of degree at least 11 by the linear polynomial (x−a)(x - a) always leaves a remainder equal to p(a)p(a) — the single most useful shortcut in this chapter, because it replaces long division with one substitution.

Step 1. Write down what division by a linear divisor must look like. When you divide p(x)p(x) by (x−a)(x - a), the division algorithm guarantees a quotient q(x)q(x) and a remainder r(x)r(x) such that p(x)=(x−a) q(x)+r(x)p(x) = (x - a)\,q(x) + r(x), where the remainder's degree is strictly less than the divisor's degree.

Step 2. Pin down the degree of the remainder. The divisor (x−a)(x-a) has degree 11, so r(x)r(x) must have degree less than 11 — that means r(x)r(x) is a constant, call it rr (it does not depend on xx at all). So the identity simplifies to p(x)=(x−a) q(x)+rp(x) = (x-a)\,q(x) + r for some fixed number rr.

Step 3. Substitute x=ax = a into that identity. The left side becomes p(a)p(a). On the right side, the term (x−a) q(x)(x - a)\,q(x) becomes (a−a) q(a)=0⋅q(a)=0(a - a)\,q(a) = 0 \cdot q(a) = 0, because (a−a)=0(a-a) = 0 regardless of what q(a)q(a) is. What remains on the right is just rr.

Step 4. Read off the result. Since the left side is p(a)p(a) and the right side collapsed to rr, they must be equal: r=p(a)r = p(a). So the remainder on dividing p(x)p(x) by (x−a)(x-a) is exactly p(a)p(a) — no long division needed, only substitution. As an immediate corollary, if p(a)=0p(a) = 0 then the remainder is zero, meaning aa is a zero of p(x)p(x); this single observation is the seed of the Factor Theorem covered in the next topic.

Worked example

Question: (a) Check whether x=2x = 2 and x=−1x = -1 are zeroes of p(x)=x2−x−2p(x) = x^2 - x - 2. (b) Use the Remainder Theorem to find the remainder when p(x)=3x3−4x2+x−6p(x) = 3x^3 - 4x^2 + x - 6 is divided by (x−2)(x-2), and relate it to the zero of g(x)=3x−6g(x) = 3x - 6.

Step 1. Test x=2x = 2 in p(x)=x2−x−2p(x) = x^2 - x - 2: p(2)=(2)2−(2)−2=4−2−2=0p(2) = (2)^2 - (2) - 2 = 4 - 2 - 2 = 0. Since p(2)=0p(2) = 0, x=2x = 2 is a zero.

Step 2. Test x=−1x = -1: p(−1)=(−1)2−(−1)−2=1+1−2=0p(-1) = (-1)^2 - (-1) - 2 = 1 + 1 - 2 = 0. Since p(−1)=0p(-1) = 0, x=−1x = -1 is also a zero, confirming this quadratic has two zeroes, 22 and −1-1, matching the picture above.

Step 3. For the second polynomial, apply the Remainder Theorem directly instead of dividing: dividing 3x3−4x2+x−63x^3 - 4x^2 + x - 6 by (x−2)(x - 2) leaves remainder p(2)p(2). Compute p(2)=3(2)3−4(2)2+(2)−6=3(8)−4(4)+2−6=24−16+2−6=4p(2) = 3(2)^3 - 4(2)^2 + (2) - 6 = 3(8) - 4(4) + 2 - 6 = 24 - 16 + 2 - 6 = 4. So the remainder is 44, found without any long division.

Step 4. Find the zero of g(x)=3x−6g(x) = 3x - 6: set 3x−6=03x - 6 = 0, so 3x=63x = 6 and x=2x = 2. The zero of g(x)g(x) is the same number, 22, that we substituted into p(x)p(x) — because g(x)=3x−6g(x) = 3x - 6 is a constant multiple of (x−2)(x - 2), and evaluating any polynomial at the zero of its linear divisor is exactly what the Remainder Theorem's substitution step does. Zeroes: x=2x = 2 and x=−1x = -1 for part (a); remainder =4= 4 for part (b), with the zero of g(x)g(x) confirmed as x=2x = 2.

Competitive stretch

For a quick check without full computation: if a linear polynomial g(x)=kx−cg(x) = kx - c has zero x=ax = a, then a=c/ka = c/k, and dividing any p(x)p(x) by g(x)g(x) (after normalising it to a monic (x−a)(x-a) form) still leaves remainder p(a)p(a) — the constant multiple does not change where the zero is, only how you write the divisor.

Common traps

  • Confusing the value p(k)p(k) (a number) with the zero (the input x=kx = k that makes that number 00) — a value of 55 is not a zero, only a value of 00 is.
  • Assuming every polynomial must have a real zero; p(x)=x2+1p(x) = x^2 + 1 has none, since p(k)=k2+1≥1p(k) = k^2 + 1 \geq 1 for every real kk.
  • Sign slip when solving ax+b=0ax + b = 0: the zero is x=−b/ax = -b/a, not b/ab/a — forgetting the minus sign is the single most common error.
  • In the Remainder Theorem, substituting x=−ax = -a instead of x=ax = a when dividing by (x−a)(x - a) — always match the sign inside the bracket exactly.

Ask the tutor: If checking zeroes by substitution feels slow, ask the AI tutor to walk through a few more practice polynomials and show how the Remainder Theorem shortcuts the arithmetic.

How is a zero of a polynomial different from a root of an equation?

They are the same idea wearing two names. If p(x)p(x) is a polynomial, the values of xx that make p(x)=0p(x) = 0 are called zeroes of the polynomial, but they are also exactly the solutions (roots) of the equation p(x)=0p(x) = 0. Some textbooks reserve "root" for equations and "zero" for the polynomial expression itself, but the numbers you find and the method of finding them are identical — substitute and solve.

Why does the Remainder Theorem work only for division by a linear polynomial like (x minus a), not by any divisor?

The proof relies on the remainder having degree strictly less than the divisor's degree. When the divisor is (x−a)(x-a), degree 11, the remainder's degree must be less than 11, forcing it to be a constant number — that constant is what lets substitution alone determine it. If you divided by a quadratic divisor instead, the remainder could itself be a linear expression (degree up to 11), so a single substitution would not pin it down completely; you would need more information than just one value.

If p(a) turns out to be zero, does that always mean (x minus a) divides p(x) exactly?

Yes, and this is the most useful consequence of the theorem. The Remainder Theorem says dividing p(x)p(x) by (x−a)(x-a) leaves remainder p(a)p(a); if p(a)=0p(a) = 0, the remainder is 00, which by definition means (x−a)(x-a) divides p(x)p(x) with nothing left over. That connection — a zero of p(x)p(x) signalling exact divisibility by (x−a)(x-a) — is exactly what the Factor Theorem states explicitly in the next topic, so understanding it here makes that theorem feel obvious rather than new.

Before this

Where this leads