Root theory
This chapter delves into the foundational principles of root theory, providing essential tools for the analysis and manipulation of polynomial equations. A thorough understanding of these concepts, including theorems for root identification and characterisation, is critical for success in CMI examinations, where they underpin various algebraic problem-solving tasks.
---
Chapter Contents
|
| Topic |
|---|-------| | 1 | Remainder theorem | | 2 | Factor theorem | | 3 | Vieta relations | | 4 | Rational roots | | 5 | Integer roots | | 6 | Multiple roots |---
We begin with Remainder theorem.
Part 1: Remainder theorem
Remainder theorem
Overview
The Remainder Theorem is one of the fastest tools in polynomial algebra. Instead of performing full long division, it lets us find the remainder after division by a linear factor using just substitution. In CMI-style questions, this saves time and also connects directly to the Factor Theorem, root testing, and polynomial structure. ---Learning Objectives
After studying this topic, you will be able to:
- Find the remainder when a polynomial is divided by .
- Use the substitution shortcut for divisors like , , and more generally .
- Apply the Factor Theorem to detect roots and factors.
- Avoid sign mistakes in expressions like and .
- Use the theorem efficiently in exam-style questions without full division.
Core Idea
If a polynomial is divided by , then the remainder is
So the remainder can be found by simply substituting into the polynomial.
When is divided by , we can write
where is a polynomial and is a constant remainder.
Now substitute :
Hence the remainder is
Special Cases You Must Know
- divisor remainder
- divisor remainder
- divisor remainder
- divisor remainder
If the divisor is , do not substitute .
Since
the correct substitution is
Factor Theorem
A polynomial has factor if and only if
So:
- if , then is a factor
- if is a factor, then is a root of
The Remainder Theorem gives the remainder .
The Factor Theorem is the special case when that remainder is zero.
General Linear Divisor
If a polynomial is divided by , then the remainder is
because gives
Minimal Worked Examples
Example 1 Find the remainder when is divided by . By the Remainder Theorem, So the remainder is . --- Example 2 Find the remainder when is divided by . Since , the remainder is So the remainder is . ---Fast Evaluation Strategy
- Convert the divisor into the form mentally.
- Substitute carefully with the correct sign.
- For large powers at or , use parity:
-
-
- In longer polynomials, group terms only if it reduces arithmetic mistakes.
- If remainder is zero, immediately think: factor, root, and further factorisation.
Pattern Recognition
If dividing by:
- remainder
- remainder
- remainder
These are extremely common in exam questions.
At , powers alternate:
So remainders for division by are often quick to compute even for high-degree polynomials.
Common Errors
- ❌ using for division by
- ❌ forgetting that the remainder on division by a linear polynomial is a constant
- ❌ treating the theorem as valid for non-linear divisors like
- ❌ concluding factor without checking remainder is exactly zero
- ❌ arithmetic mistakes while substituting negative values
- rewrite divisor as
- substitute slowly
- use parity for powers of
- connect zero remainder with factor theorem
Practice Questions
:::question type="MCQ" question="Find the remainder when is divided by ." options=["","","",""] answer="B" hint="Use the substitution ." solution="By the Remainder Theorem, the remainder is Hence the correct option is ." ::: :::question type="NAT" question="Find the remainder when is divided by ." answer="-5" hint="For division by , substitute ." solution="The remainder is Hence the answer is ." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["If a polynomial is divided by , the remainder is .","If , then is a factor of .","If , then the remainder when is divided by is .","If is a factor of , then ."] answer="A,C,D" hint="Use the remainder theorem and factor theorem carefully." solution="1. True. This is exactly the Remainder Theorem.Summary
- The remainder on division by is .
- The divisor corresponds to substitution at .
- Zero remainder means factor.
- Factor theorem is the zero-remainder version of remainder theorem.
- For divisor , substitute .
- Fast substitution is often much better than long division in exam settings.
---
Proceeding to Factor theorem.
---
Part 2: Factor theorem
Factor Theorem
Overview
The factor theorem is one of the most powerful bridges between roots and divisibility of polynomials. In exam problems, it is rarely used in isolation. It appears in proving divisibility, constructing polynomials from given roots, identifying repeated roots, and reducing higher-degree expressions by extracting known factors. ---Learning Objectives
After studying this topic, you will be able to:
- use the factor theorem to test whether divides a polynomial,
- apply the remainder theorem quickly,
- prove that distinct roots give a product factor,
- handle repeated roots and multiplicity,
- use factor-based reasoning in algebraic and proof-style questions.
Core Theorem
Let be a polynomial and let be a real or complex number.
Then
is a factor of
In words: a number is a root of a polynomial if and only if divides the polynomial.
When a polynomial is divided by , the remainder is
So:
- if , then the remainder is , hence divides
- if , then is not a factor
First-Principles Proof Pattern
When dividing by , we can write
where is a constant.
Now substitute :
So if , then , and therefore
Hence is a factor of .
Distinct Roots Give a Product Factor
If and are distinct roots of , then
divides
Reason:
- Since , we get
- Now substitute :
- Since , we have , so
- Therefore divides
- Hence divides
If are distinct roots of , then
divides
Repeated Roots and Multiplicity
If
with , then is called a root of multiplicity .
Examples:
- multiplicity simple root
- multiplicity repeated root or double root
- multiplicity triple root
If divides , then is a repeated root.
A very useful criterion is:
is a repeated root of if and only if
and
How to Use the Theorem in Practice
- If you are asked whether is a factor, compute immediately.
- If you are given a root, write the polynomial as
- If two distinct roots are given, extract one factor first, then use the second root on the quotient.
- If a repeated root is suspected, check both
and
- In proof questions, remember that the remainder after division by is a constant.
Important Extensions
The same logic works for polynomials in two variables.
If is a polynomial and after substituting we get
for all relevant , then
divides
This is the two-variable analogue of the factor theorem.
- if , then divides
- symmetry may force another related factor as well
- multiplying conjugate factors can give a polynomial with integer coefficients
Symmetric Polynomial Insight
Let be a cube root of unity with
If a symmetric polynomial satisfies
then divides .
Since , interchanging and can force a related factor as well.
A very common resulting integer-coefficient factor is
Minimal Worked Examples
Example 1 Check whether divides Compute Since , is not a factor. --- Example 2 Check whether divides Compute So is a factor. In fact, --- Example 3 Suppose and are roots of a polynomial . Then divides So can be written as for some polynomial . ---Common Mistakes
- ❌ Forgetting that the remainder on division by is a constant
- ❌ Confusing “ is a root” with “ is a root”
- ❌ Assuming two roots automatically mean degree
- ❌ Forgetting that repeated roots need higher powers like
- ❌ Using the factor theorem without checking arithmetic carefully
Quick Recognition Sheet
- divides
- remainder on division by is
- if are distinct roots, then divides
- if is a repeated root, then divides
- repeated root test:
Practice Questions
:::question type="MCQ" question="If , then which of the following must be true?" options=[" is a factor of "," is a factor of "," is a factor of "," is constant"] answer="B" hint="Use the factor theorem directly." solution="By the factor theorem, is a factor. Here , so is a factor of . Hence the correct option is ." ::: :::question type="NAT" question="Find the remainder when is divided by ." answer="13" hint="Use the remainder theorem." solution="By the remainder theorem, the remainder on division by is Now, Hence the remainder is ." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["If and with , then divides ","If divides , then ","If , then divides ","If divides , then is a repeated root of "] answer="A,B,D" hint="Use factor theorem and multiplicity." solution="1. True. Distinct roots give the product factor.Summary
- The factor theorem converts root information into divisibility information.
- The remainder theorem is the fastest way to test linear factors.
- Distinct roots give a product of distinct linear factors.
- Repeated roots correspond to higher powers like .
- In proof questions, the form
is the standard starting point.
- The same idea extends naturally to multivariable polynomial divisibility.
---
Proceeding to Vieta relations.
---
Part 3: Vieta relations
Vieta Relations
Overview
Vieta relations connect the coefficients of a polynomial directly to sums and products of its roots. This makes them one of the fastest tools in algebra: instead of finding the roots explicitly, we can still compute expressions involving them. In CMI-style questions, Vieta relations often appear together with symmetry, divisibility, reciprocal roots, and power sums such as . ---Learning Objectives
After studying this topic, you will be able to:
- Write Vieta relations for monic and non-monic polynomials.
- Compute sums, pairwise products, and full products of roots without solving the polynomial.
- Find sums of powers such as using symmetric identities.
- Compute sums of reciprocals of roots when allowed.
- Use divisibility conditions like or to extract coefficient information.
Standard Setup
Let
with .
Let its roots be in the complex number system, counted with multiplicity.
Then
Vieta Relations for a Monic Polynomial
If
has roots , then
The signs alternate:
- sum of 1 root negative
- sum of 2-root products positive
- sum of 3-root products negative
- and so on
Vieta Relations for a General Polynomial
If
has roots , then
Most Useful Derived Identities
Let
and
Then
Also,
where
The formula used most often in short questions is
Sum of Reciprocals of Roots
If none of the roots is zero, then
In coefficient form,
This formula is valid only when , equivalently when is not a root.
Divisibility and Roots
For any polynomial :
- divides if and only if
- divides if and only if both and
since
Many Vieta problems do not ask for the roots directly. Instead, they tell you something like:
- polynomial is divisible by
- and are roots
- roots satisfy a reciprocal condition
and then expect coefficient information from these facts.
PYQ Insight 1: Sum of Squares of Roots
If
has roots , then
and
Therefore,
So the required value is .
PYQ Insight 2: Divisibility by
Suppose
is divisible by .
Then
and
Now
so
Also
so
Solving,
Now since , none of the roots is zero, so
This is exactly the kind of two-step use of Vieta that appears in exams.
Minimal Worked Examples
Example 1 If the roots of are , then --- Example 2 If the roots of are , then because for a cubic and here ---Root Transform Tricks
If roots are , then:
- roots of are
- roots of are
- if none of the roots is zero, then the roots of
are
CMI Strategy
- Write the degree and coefficients clearly.
- Identify which symmetric expression is being asked.
- Use direct Vieta first: , , product of roots.
- For , do not try to find roots; use
- For reciprocal sums, check first that zero is not a root.
- If divisibility is given, immediately apply the factor theorem.
- Keep sign alternation under control; most mistakes here are sign mistakes.
Common Mistakes
- ❌ Forgetting the alternating sign pattern in Vieta
- ❌ Using monic formulas on a non-monic polynomial without dividing by the leading coefficient
- ❌ Using when
- ❌ Confusing with
- ❌ Forgetting that divisibility by means checking both and
Practice Questions
:::question type="MCQ" question="If are the roots of , then equals" options=["","","",""] answer="B" hint="Use the coefficient of ." solution="For the monic quadratic , the sum of roots is the negative of the coefficient of . Thus So the correct option is ." ::: :::question type="NAT" question="If the roots of are , find ." answer="6" hint="Use ." solution="From Vieta, and Hence Therefore the answer is ." ::: :::question type="MSQ" question="Which of the following statements are true for a polynomial with nonzero roots ?" options=["","","If divides , then ","If divides , then only is needed"] answer="A,B,C" hint="Use Vieta and the factor theorem." solution="1. True. This is the standard product-of-roots formula.Summary
- Vieta relations connect coefficients directly with symmetric sums of roots.
- For non-monic polynomials, divide by the leading coefficient mentally.
- The fastest derived identity is
- The reciprocal sum formula is
,
but only when .
- Divisibility conditions and Vieta often work together.
- Most errors in this topic come from sign mistakes, not concept mistakes.
---
Proceeding to Rational roots.
---
Part 4: Rational roots
Rational Roots
Overview
The idea of a rational root is simple: it is a root that can be written in the form where and are integers and . But in polynomial equations, especially CMI-style algebra, rational roots are useful not only for finding solutions, but also for testing factorisation, reducing degree, and proving non-existence of easy roots. This topic mainly revolves around the Rational Root Theorem, careful substitution, and the link between roots and factors. ---Learning Objectives
After studying this topic, you will be able to:
- identify what a rational root is
- apply the Rational Root Theorem correctly
- list all possible rational roots of a polynomial
- test candidates efficiently using substitution
- use a rational root to factor a polynomial and reduce its degree
Definition
A rational root of a polynomial equation is a root of the form
where , , and the fraction is in lowest terms.
Core Link Between Roots and Factors
If is a polynomial and
then is a factor of .
So every rational root immediately gives a linear factor.
If you find one rational root of a polynomial of degree or higher, then:
- you get a factor
- you can divide the polynomial by that factor
- the remaining problem becomes simpler
Rational Root Theorem
Let
be a polynomial with integer coefficients.
If in lowest terms is a rational root of , then
- divides the constant term
- divides the leading coefficient
So every possible rational root must be of the form
How to Generate Candidates
For a polynomial with integer coefficients:
- write all factors of the constant term
- write all factors of the leading coefficient
- form all possible fractions
- include both positive and negative values
- test each candidate in the polynomial
This gives all possible rational roots, not guaranteed roots.
Important Special Cases
If the polynomial is monic, that is, the leading coefficient is , then every rational root must actually be an integer dividing the constant term.
For example, if
then any rational root must be among the integer divisors of :
If the constant term is , then
is automatically a root, and is a factor of the polynomial.
Minimal Worked Examples
Example 1 Find all possible rational roots of Here:- constant term
- leading coefficient
Efficient Testing Ideas
When testing candidate roots:
- start with small integers first:
- look for sign cancellation or easy mental arithmetic
- if the polynomial is monic, test divisors of the constant term first
- once a root is found, factor immediately instead of testing all remaining candidates blindly
Rational Root Theorem Does Not Say
The Rational Root Theorem does not say:
- every polynomial has a rational root
- every candidate obtained is an actual root
- irrational or complex roots do not exist
It only says:
if a rational root exists, then it must come from the candidate list.
Relation with Factorisation
If is a rational root of , then
for some polynomial .
This is the usual next step in solving cubic and quartic equations by algebraic methods.
Common Error Patterns
- ❌ forgetting to reduce to lowest terms before applying the theorem
- ❌ listing only positive candidates and forgetting negatives
- ❌ confusing possible rational roots with actual roots
- ❌ making arithmetic mistakes while testing candidates
- ❌ forgetting that the theorem requires integer coefficients
When the Theorem Applies
Use the Rational Root Theorem when:
- the polynomial has integer coefficients
- you want to find rational roots or show likely absence of simple rational roots
- you want to begin factorisation of a cubic or quartic
Use caution if coefficients are not integers. In such cases, first clear denominators if convenient.
Strategy for CMI-Type Questions
- First inspect whether the polynomial is monic.
- Write the constant term and leading coefficient separately.
- Generate the full rational candidate set carefully.
- Test easy candidates first.
- Once a root is found, factor and reduce the degree.
- If no candidate works, conclude there is no rational root from the theorem.
Practice Questions
:::question type="MCQ" question="Which of the following can be a rational root of the polynomial ?" options=["","","",""] answer="B" hint="Use the Rational Root Theorem: numerator divides the constant term, denominator divides the leading coefficient." solution="For the polynomial the constant term is and the leading coefficient is . So a rational root, if it exists, must be of the form Hence the possible rational roots are Among the given options, only appears in the candidate list. Therefore the correct option is ." ::: :::question type="NAT" question="How many possible rational roots does the polynomial equation have according to the Rational Root Theorem?" answer="8" hint="The polynomial is monic, so possible rational roots are just the integer divisors of the constant term, with both signs." solution="The polynomial is Since it is monic, any rational root must be an integer dividing the constant term . The divisors of are Including both positive and negative values, the possible rational roots are This gives a total of possible rational roots." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["If is a rational root in lowest terms of a polynomial with integer coefficients, then divides the constant term","If is a rational root in lowest terms of a polynomial with integer coefficients, then divides the leading coefficient","Every candidate from the Rational Root Theorem is an actual root","If a polynomial is monic with integer coefficients, then every rational root must be an integer"] answer="A,B,D" hint="Recall exactly what the theorem guarantees." solution="1. True. This is one part of the Rational Root Theorem.Summary
- A rational root is a root of the form with integers and .
- For a polynomial with integer coefficients, any rational root must satisfy:
- numerator divides the constant term
- denominator divides the leading coefficient
- The theorem gives a candidate list, not actual roots.
- For monic polynomials, every rational root must be an integer divisor of the constant term.
- Once a rational root is found, factor the polynomial and reduce the degree.
- The theorem is a filtering tool and a factorisation tool, not a guarantee of solvability.
---
Proceeding to Integer roots.
---
Part 5: Integer roots
Integer Roots
Overview
When a polynomial has integer coefficients, its integer roots are highly restricted. In CMI-style problems, the main idea is that an integer root cannot be arbitrary: it must interact in a rigid way with the constant term and with Vieta's relations. This topic is not just about testing divisors, but about combining Factor Theorem, Remainder Theorem, and Vieta's formulas intelligently. ---Learning Objectives
After studying this topic, you will be able to:
- use the Factor Theorem to test whether an integer is a root.
- apply the integer-root condition for monic polynomials with integer coefficients.
- use divisibility of the constant term to shortlist possible integer roots.
- connect integer roots with Vieta's formulas in quadratic and cubic equations.
- rule out impossible rational roots in monic integer polynomials.
Core Idea
An integer root of a polynomial is an integer such that
By the Factor Theorem, this is equivalent to saying that
is a factor of .
If , then
is a factor of .
Conversely, if divides , then
Remainder Theorem
When a polynomial is divided by , the remainder is
So:
- if , then is a root
- if , then is not a root
To test whether an integer is a root, you do not need full factorisation. Just compute
If it is , then is a root.
Main Integer Root Rule
Let
have integer coefficients.
If an integer is a root of , then
That is, the integer root must divide the constant term.
If
has integer coefficients and is an integer root, then
So the only possible integer roots are the positive and negative divisors of the constant term.
Why Integer Roots Divide the Constant Term
Suppose is a root of
Then
So
Hence is a multiple of . Therefore
Consequences for Monic Integer Polynomials
For a monic polynomial with integer coefficients:
- every integer root must divide the constant term
- if the constant term is prime, the only possible integer roots are
- if the constant term is , then the only possible integer roots are
- if the constant term is , then
is definitely a root
Rational Root Observation
For a monic polynomial with integer coefficients, any rational root must actually be an integer.
So if
has integer coefficients, then roots like
cannot occur as rational roots.
This is a special case of the Rational Root Theorem.
For a monic polynomial, if in lowest terms is a rational root, then
- divides the constant term
- divides the leading coefficient
But the leading coefficient is , so
Hence the rational root is an integer.
Vieta's Formulas and Integer Roots
If
has roots , then
So if both roots are integers, they are integer factor pairs of whose sum is .
If
has roots , then
So if one root is an integer, it must divide .
If all three roots are integers, then their product is exactly .
Polynomial Decomposition Around a Root Candidate
For any polynomial and any number ,
This is just the division algorithm.
So if the coefficients of are integers and is an integer, then also has integer coefficients when dividing by .
This is often useful when is known but is not necessarily a root.
Minimal Worked Examples
Example 1 Find all possible integer roots of Since the polynomial is monic and the constant term is , any integer root must divide . So the only possibilities are These are the only candidates worth testing. --- Example 2 Can be a root of a monic polynomial with integer coefficients? No. Because any rational root of a monic polynomial with integer coefficients must be an integer. Since is not an integer, it cannot be such a root. ---Standard Solving Strategy
- identify the constant term.
- list all integer divisors of the constant term.
- test them using the Remainder Theorem.
- once one root is found, factor out .
- solve the lower-degree polynomial that remains.
- use Vieta's relations if the problem asks about sums, products, or possible values.
Common Mistakes
- ❌ Thinking any integer can be a root
- ❌ Forgetting signs
- ❌ Confusing integer root condition with full factorisation
- ❌ Forgetting that monic integer polynomials cannot have non-integer rational roots
- ❌ Using Vieta without checking coefficient signs
CMI Strategy
- Use divisibility first, not expansion.
- If the constant term is small or highly structured, exploit its divisors.
- If the polynomial is monic, eliminate fractional rational roots immediately.
- In cubic problems, combine:
- root divides constant term
- sum/product from Vieta
- If a value like is given, rewrite using
Practice Questions
:::question type="MCQ" question="If , then which of the following can be an integer root of ?" options=["","","",""] answer="C" hint="An integer root of a monic polynomial must divide the constant term." solution="The polynomial is monic and its constant term is . So any integer root must divide . The possible integer roots are Among the options, only is possible as an integer root candidate. Therefore the correct answer is ." ::: :::question type="NAT" question="How many positive integer roots can a monic polynomial with integer coefficients and constant term possibly have as candidates before testing?" answer="6" hint="Count the positive divisors of ." solution="For a monic polynomial with integer coefficients, every integer root must divide the constant term. So if the constant term is , the positive integer root candidates are the positive divisors of : There are such candidates. Hence the answer is ." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["If an integer is a root of a polynomial with integer coefficients, then divides the constant term.","Every divisor of the constant term is automatically a root.","If a monic polynomial with integer coefficients has a rational root, then that root must be an integer.","For , the product of the roots is ."] answer="A,C,D" hint="Separate root conditions from root candidates." solution="1. True. This is the standard integer-root divisibility condition.- divides the constant term
- divides the leading coefficient
Summary
- An integer root of an integer-coefficient polynomial must divide the constant term.
- For monic integer polynomials, rational roots must actually be integers.
- Factor Theorem and Remainder Theorem are the fastest tools for testing root candidates.
- Vieta's formulas connect roots with coefficients and are especially useful in cubic problems.
- Divisibility gives possible roots, not guaranteed roots.
- In root-theory questions, combine divisibility, factorisation, and Vieta instead of using only one idea.
---
Proceeding to Multiple roots.
---
Part 6: Multiple roots
Multiple Roots
Overview
A multiple root is much more than “a root repeated twice”. It changes the algebra, the graph, and the derivative structure of a polynomial. In CMI-style questions, this topic is often tested through factorisation, derivative sharing, uniqueness of real roots, and monic integer polynomials. The central idea is: This makes derivatives a natural tool in root theory. ---Learning Objectives
After studying this topic, you will be able to:
- define multiplicity of a root precisely
- detect repeated roots using and
- understand how multiplicity changes after differentiation
- connect multiple roots with graph behaviour
- use multiplicity ideas in monic, rational, and integer-coefficient polynomials
Core Definition
A number is called a root of multiplicity of a polynomial if
for some polynomial such that
Here:
- means a simple root
- means a multiple root
If is a root of multiplicity , then
- if
- if
- in general, the first derivatives vanish at
That is,
but
The Main Test for Repeated Roots
A polynomial has a repeated root if and only if
Equivalently:
How Differentiation Changes Multiplicity
If is a root of multiplicity of , then is a root of multiplicity of .
Examples:
- if is a double root of , then is a simple root of
- if is a triple root of , then is a double root of
- if is a quadruple root of , then is a triple root of
Graph Meaning
If is a root of :
- odd multiplicity graph crosses the -axis
- even multiplicity graph touches the -axis and turns back
Special cases:
- simple root: crosses normally
- double root: touches and turns
- triple root: crosses but flattens
Even Degree and “Exactly One Real Root”
For a polynomial of even degree with real coefficients, non-real roots occur in conjugate pairs.
So if such a polynomial has exactly one distinct real root, then that real root must have even multiplicity.
For a quartic polynomial, if there is exactly one real number such that , then the multiplicity of must be:
- , or
In particular, is a multiple root.
Once you know the unique real root is multiple, you immediately know
So the derivative becomes a root-detection tool.
Quadratic Case
For
a repeated root occurs exactly when the discriminant is zero:
In that case, the double root is
Rational and Integer Coefficients
If a monic polynomial with integer coefficients has a rational root, then that root must be an integer.
Reason:
By the Rational Root Theorem, if
in lowest terms is a root of
with integer coefficients, then
So , hence the root is an integer.
In monic integer polynomials, once you prove a root is rational, you have automatically proved it is an integer.
Standard Factor Forms
- double root at :
- triple root at :
- quartic with exactly one distinct real root:
Minimal Worked Examples
Example 1 Show that is a repeated root of We factor: So is a root of multiplicity . Also, Hence --- Example 2 For what value of does have a repeated root? A repeated root in a quadratic means discriminant zero: ---CMI Strategy
- first ask whether the root is simple or repeated
- if repeated, write and
- for quadratics, use discriminant zero
- for monic integer polynomials, prove rational first, then conclude integer
- if a polynomial has exactly one real root and even degree, expect even multiplicity
- if needed, rewrite the polynomial as and compare coefficients
Common Mistakes
- ❌ thinking “one real root” means multiplicity
- ❌ forgetting that non-real roots come in conjugate pairs for real coefficients
- ❌ using only and forgetting for repeated roots
- ❌ assuming every touching point is a double root without checking algebraically
- ❌ forgetting that for monic integer polynomials, rational roots are automatically integers
Practice Questions
:::question type="MCQ" question="If is a double root of a polynomial , which of the following must be true?" options=[" and "," and "," and always",""] answer="B" hint="Use the repeated root criterion." solution="If is a double root, then divides . Therefore and also . So the correct option is ." ::: :::question type="NAT" question="The polynomial has a root of multiplicity what?" answer="3" hint="Recognize a binomial expansion." solution="We observe that Hence is the only root, and it has multiplicity ." ::: :::question type="MSQ" question="Which of the following statements are true?" options=["If is a repeated root of , then is a root of .","A quartic polynomial with real coefficients and exactly one distinct real root must have that root with even multiplicity.","If a monic polynomial with integer coefficients has a rational root, then that root is an integer.","If , then must be a repeated root."] answer="A,B,C" hint="Separate the repeated-root test from the ordinary root condition." solution="1. True. A repeated root is a common root of and .Summary
- A root has multiplicity if with .
- A repeated root is exactly a common root of and .
- Differentiation reduces multiplicity by .
- In even-degree real polynomials, a unique real root must have even multiplicity.
- For monic integer polynomials, rational roots are automatically integers.
- In root theory problems, the pair and is often the decisive step.
Chapter Summary
- Remainder & Factor Theorems: is the remainder when is divided by . Consequently, is a factor of if and only if . These are fundamental for evaluating polynomials and identifying linear factors.
- Vieta's Relations: These critical relationships connect the coefficients of a polynomial to symmetric expressions of its roots (sums, products, and sums of products). They are indispensable for solving problems involving root properties without explicit calculation of the roots.
- Rational Root Theorem: For a polynomial with integer coefficients, any rational root (in simplest form) must satisfy that divides the constant term and divides the leading coefficient. This theorem significantly narrows the search space for rational roots.
- Integer Root Theorem: A special case of the Rational Root Theorem, stating that any integer root of a polynomial with integer coefficients must be a divisor of the constant term.
- Multiple Roots: If is a multiple root of a polynomial , then and . This derivative test is a powerful tool for identifying repeated roots and simplifying polynomial factorization.
---
Chapter Review Questions
:::question type="MCQ" question="Let be the roots of the polynomial equation . Determine the value of ." options=["6","10","14","22"] answer="14" hint="Use Vieta's relations to express the sum of squares in terms of elementary symmetric polynomials." solution="From Vieta's relations:
We know that .
Substituting the values:
."
:::
:::question type="NAT" question="If the polynomial leaves a remainder of 3 when divided by , what is the value of ?" answer="3" hint="Apply the Remainder Theorem directly." solution="By the Remainder Theorem, must be equal to the remainder when is divided by .
Given remainder is 3, so .
Substitute into :
."
:::
:::question type="MCQ" question="For what value of does the polynomial have a multiple root?" options=["-8","-4","0","4"] answer="-8" hint="If is a multiple root, then and ." solution="If has a multiple root at , then and .
First, find the derivative of :
.
Set to find potential multiple roots:
This implies that is the only potential multiple root.
For to be a multiple root of , we must have .
Substitute into :
.
Setting :
."
:::
:::question type="NAT" question="Find the sum of all integer roots of the polynomial ." answer="2" hint="Use the Integer Root Theorem to identify potential roots, then test them." solution="According to the Integer Root Theorem, any integer root of must be a divisor of the constant term, 12.
The divisors of 12 are .
Let's test these values:
. So is a root.
. So is a root.
. So is a root.
. So is a root.
The integer roots are .
The sum of these integer roots is ."
:::
---
What's Next?
This chapter has equipped you with essential tools for analyzing polynomial equations. Building upon this foundation, your CMI journey will extend to related areas. The study of Polynomial Functions will delve deeper into their graphical properties, transformations, and applications. The concept of roots naturally leads to Complex Numbers, where every polynomial equation has a full set of solutions. Furthermore, Calculus provides powerful analytical methods, such as differentiation, to efficiently identify multiple roots, determine local extrema, and understand the precise behavior of polynomial functions.