Degree
If , its degree is . We write .
From basic manipulations to the algebraic structure you will meet at university. The goal is not to memorize a bag of tricks, but to recognize which idea applies and why it works.
A polynomial in one variable with coefficients in a set has the form
where the exponents are non-negative integers and the coefficients belong to , for example , or .
If , its degree is . We write .
is the leading coefficient; is the constant term. A polynomial whose leading coefficient is 1 is monic.
All its coefficients are zero. Its degree is not treated like that of other polynomials; a common convention is .
Two polynomials are equal when the coefficients of corresponding powers are equal. Agreeing at one or a few values of is not enough.
| Operation | Rule | Remark |
|---|---|---|
| Sum | Add the coefficients of terms with the same power. | ; the degree may decrease through cancellation. |
| Product | Use the distributive property and add the exponents of powers being multiplied. | Over β, β or β, if , then . |
| Power | Multiply the polynomial by itself repeatedly. | for and . |
| Composition | Substitute for in . | if both have positive degree. |
These are identities: they hold for every choice of the expressions and . You should be able to use them in both directions, to expand and to factor.
| Name | Identity | Pattern to recognize |
|---|---|---|
| Square of a sum | Two squares and a positive twice-product. | |
| Square of a difference | Two squares and a negative twice-product. | |
| Sum times difference | A difference of squares. | |
| Cube of a sum | Coefficients 1, 3, 3, 1 and complementary powers. | |
| Cube of a difference | Coefficients 1, 3, 3, 1 with alternating signs. | |
| Sum of cubes | The binomial keeps the sign; in the trinomial the mixed term has the opposite sign. | |
| Difference of cubes | The binomial keeps the sign; every sign in the trinomial is positive. |
The binomial coefficients give the rows of Pascalβs triangle. This formula reappears in combinatorics, probability, calculus and linear algebra.
Factoring means writing a polynomial as a product of lower-degree polynomials. The factorization depends on the allowed coefficient set.
Extract the greatest common factor: .
Group terms that share a common factor: .
.
Recognize a simpler structure: letting , becomes .
If you find such that , then is a factor. Divide and continue with the quotient.
, then use the difference of squares.
For the monic trinomial , look for two numbers and whose sum is and whose product is :
In the general case , calculate the discriminant . If the roots are and , then
ViΓ¨teβs formulas give and : they are useful far beyond factoring.
If and have coefficients in a field, there are unique polynomials and such that
Check: reconstructs the dividend.
The remainder when dividing by is the number .
if and only if divides . In Italy this is often called Ruffiniβs theorem.
has multiplicity if divides , but the next power does not.
The remainder theorem follows directly from division:
Ruffiniβs rule is synthetic division: it shortens division by a monic linear divisor . It does not apply directly to divisors such as or .
Example: divide by .
| 2 | β3 | β11 | 6 | |
| products | 6 | 9 | β6 | |
| sums | 2 | 3 | β2 | 0 |
Here the quotient is and the remainder is zero. Therefore
For a polynomial with integer coefficients
If a reduced fraction is a rational root, then divides the constant term and divides the leading coefficient .
If the leading coefficient is 1, every possible rational root is an integer dividing the constant term.
Candidates must be checked by evaluating . A divisor of the constant term is not automatically a root.
If , factor out : zero is already a root.
For , the only rational candidates are . The search is now finite.
| Polynomial | Over β | Over β | Over β |
|---|---|---|---|
| It has no factorization into rational linear factors. | The same real factorization. | ||
| Irreducible. | Irreducible. | ||
| Each quadratic factor splits further into linear factors. | |||
As with integers, the greatest common divisor of two polynomials is found through repeated division:
The last nonzero remainder, made monic, is the GCD. This method is more fundamental than full factorization: it works even when the factors are not apparent.
and are coprime if their GCD is 1, up to nonzero constants.
There are polynomials and such that .
In characteristic zero, has repeated roots if and only if .
A rational expression is a quotient with . Factoring numerator and denominator allows simplification, but does not erase the original domain restrictions.
The simplified form is equivalent only for .
: the term is missing.
. The sign changes for every term.
In the coefficients are , not three numbers.
To divide by with synthetic division, use .
The rational root theorem only produces a list of candidates; each one must be checked.
The remainder is valid only when its degree is strictly less than the divisorβs degree.
Canceling a denominator factor does not restore the values that made it zero to the domain.
Saying that a polynomial βdoes not factorβ is incomplete: specify whether you are working over β, β or β.
Try to justify every step and reveal the solution only at the end.
Factor .
First factor out , then recognize a difference of squares:
.
Factor .
The roots are and . Therefore
.
Factor over β .
With you get .
Therefore .
Find the remainder when dividing by .
By the remainder theorem, it is enough to calculate .
Factor over β .
The integer candidates are . Since , synthetic division gives the quotient .
Result: .
Find the roots and their multiplicities for .
.
The roots 0 and 1 both have multiplicity 2.
Factor over β and over β.
It is irreducible over β. Over β, letting , we have .
The last factor, , is irreducible over β.
Simplify and state the restrictions.
, with .