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 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 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.
A real number is a zero of the polynomial exactly when , and the Remainder Theorem turns the search for zeroes into simple substitution: dividing by always leaves remainder .
The core idea
Evaluating a polynomial. If is a polynomial in and is any real number, replacing every in with gives a single number, written and called the value of at . 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 is called a zero of if substituting it makes the polynomial vanish:
where: is the polynomial, is the candidate value being tested, and is the number you get after substitution — a zero is any for which that number is exactly .
Zero of a linear polynomial. For with , setting and solving for gives
where: is the coefficient of (never zero, or the polynomial would not be linear), is the constant term, and 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 . For any real , , which never touches . 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 , which has zeroes and ), a cubic up to three, and so on — a degree- polynomial has at most zeroes.
The goal is to show, using only the division algorithm every student already knows for numbers, that dividing any polynomial of degree at least by the linear polynomial always leaves a remainder equal to — 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 by , the division algorithm guarantees a quotient and a remainder such that , where the remainder's degree is strictly less than the divisor's degree.
Step 2. Pin down the degree of the remainder. The divisor has degree , so must have degree less than — that means is a constant, call it (it does not depend on at all). So the identity simplifies to for some fixed number .
Step 3. Substitute into that identity. The left side becomes . On the right side, the term becomes , because regardless of what is. What remains on the right is just .
Step 4. Read off the result. Since the left side is and the right side collapsed to , they must be equal: . So the remainder on dividing by is exactly — no long division needed, only substitution. As an immediate corollary, if then the remainder is zero, meaning is a zero of ; this single observation is the seed of the Factor Theorem covered in the next topic.
Worked example
Question: (a) Check whether and are zeroes of . (b) Use the Remainder Theorem to find the remainder when is divided by , and relate it to the zero of .
Step 1. Test in : . Since , is a zero.
Step 2. Test : . Since , is also a zero, confirming this quadratic has two zeroes, and , matching the picture above.
Step 3. For the second polynomial, apply the Remainder Theorem directly instead of dividing: dividing by leaves remainder . Compute . So the remainder is , found without any long division.
Step 4. Find the zero of : set , so and . The zero of is the same number, , that we substituted into — because is a constant multiple of , and evaluating any polynomial at the zero of its linear divisor is exactly what the Remainder Theorem's substitution step does. Zeroes: and for part (a); remainder for part (b), with the zero of confirmed as .
Competitive stretch
For a quick check without full computation: if a linear polynomial has zero , then , and dividing any by (after normalising it to a monic form) still leaves remainder — the constant multiple does not change where the zero is, only how you write the divisor.
Common traps
- Confusing the value (a number) with the zero (the input that makes that number ) — a value of is not a zero, only a value of is.
- Assuming every polynomial must have a real zero; has none, since for every real .
- Sign slip when solving : the zero is , not — forgetting the minus sign is the single most common error.
- In the Remainder Theorem, substituting instead of when dividing by — 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 is a polynomial, the values of that make are called zeroes of the polynomial, but they are also exactly the solutions (roots) of the equation . 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 , degree , the remainder's degree must be less than , 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 ), 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 by leaves remainder ; if , the remainder is , which by definition means divides with nothing left over. That connection — a zero of signalling exact divisibility by — is exactly what the Factor Theorem states explicitly in the next topic, so understanding it here makes that theorem feel obvious rather than new.