Welcome! Today we're tackling Verifying Zeros at Surd Values — a skill that trips up many students but doesn't have to trip up you.
You have evaluated polynomials at integers, negatives, and fractions.
But many polynomials have zeros that are surds — irrational numbers like or surd.
These appear frequently in problems, and the arithmetic is different from what you are used to.
In this lesson, you will learn:
| What | Why it matters |
|---|---|
| Techniques for evaluating at surd values | Handle irrational zeros confidently |
| The shortcut | Simplify calculations quickly |
| Degree-based zero count | Built-in error check |
You've evaluated polynomials at integers, negatives, and fractions. But many polynomials have zeros that are surds — irrational numbers like or . These appear frequently in problems.
Surd verification begins with one fundamental fact:
key identity
This is the definition of square root, and it turns what looks like complicated arithmetic into a clean integer computation.
Examples:
The fundamental fact:
This makes evaluating polynomials at surds much simpler than it first appears.
Your turn ✏️
Verify that is a zero of .
Show complete working.
The key fact for surd evaluation:
This is the definition of square root — the very reason we call it a square root in the first place.
So . Not , not something complicated — just 5answer.
Verify: Is a zero of ?
Method: Substitute into
Using the key fact :
So:
Conclusion: Since , we confirm that is a zero of .
Note: is also 5, because squaring removes the negative sign.
So is also a zero:
You've been evaluating polynomials at integers, negatives, and fractions. But many polynomials have zeros that are surds — irrational numbers like or . These appear frequently in problems.
Simple surds like are straightforward.
The harder case: Compound surds like , where both the integer part and the surd part need to be squared.
There's a shortcut that makes this clean.
The squaring shortcut:
So:
The square and the square root cancel out — you just square the coefficient and multiply by what's under the root.
Your turn 🧮
Compute .
Then use it to evaluate the first term of at .
Show your steps, not just the final answer.
Here is the shortcut for squaring compound surds:
The gets squared, and the squared just gives . Multiply the two results.
Example: answer
Let's see this in action:
More examples:
Now for the first term of at :
result
Notice: the squared surd became a clean integer (12), and then multiplying by gave a term with as a common factor. This is the typical pattern in surd verification — terms often share a common surd factor that cancels or combines.
You've evaluated polynomials at integers, negatives, and fractions. Now let's tackle something more interesting — surd zeros.
Many polynomials have zeros that are irrational numbers like or . These appear frequently in problems, and verifying them requires a specific technique.
Here's the key insight: when evaluating a polynomial at a surd value, each term will often have the surd as a common factor.
For example, when evaluating at :
Factor out the common surd, then do simple integer arithmetic.
Your Turn ✏️
Verify that is a zero of .
Show every step.
Let's go through this step by step.
We need to evaluate at .
This means we'll substitute everywhere we see in the polynomial.
Term 1:
First: = = 12result
Then: =
Term 2:
This one is straightforward multiplication — no squaring involved!
Term 3:
This term has no in itconstant — it's a constant! No calculation needed, it stays exactly as .
Now all three terms have as a common factor. Factor it out:
✓ Since , we have verified that verified! is indeed a zero of the polynomial.
The strategy for surd verification:
Simplify each term to have a common surd factor, then combine the integer multipliers.
If they add to 0, the value is confirmed as a zero.
Applying the strategy to our problem:
For at :
With surd verification complete, let's return to the at-most-n-zeros rule as a consistency check.
After finding zeros (including surd zeros), comparing the count with the degree confirms that everything is consistent — or catches an error before it goes unnoticed.
Look at the graph:
| Polynomial | Degree | Zeros Found |
|---|---|---|
| 2 | and | |
| 2 | ? |
Comparing zero count with degree is your error-catching tool.
Question 🤔
has zeros and .
Is this consistent with the degree?
For , how many real zeros are there, and why?
The degree sets the ceiling for real zeros, not the floor.
For (degree 2): We found and as zeros. That's 2 zeros for a degree-2 polynomial. Since , this is consistent.
Look at the first diagram — see how the parabola crosses the x-axis at exactly two points?
For (degree 2): For any real , we have . So . The polynomial is always at least 1, and never equals 0. Zero real zeros.
The second diagram shows this — the parabola sits entirely above the x-axis!
So a degree-2 polynomial can have 0, 1, or 2 real zeros:
This is your error-detection alarm: After finding zeros, compare the count with the degree. If the count exceeds the degree, recheck your work.
For example, if you're working with and you somehow find 3 zeros — stop! A degree-2 polynomial can have at most 2 real zeros. Something went wrong in your calculation.