The line and the parabola are the first two members of a family, and there is nothing in either that suggests the family should stop at degree two. Cubics and quartics are written the same way, arise from the same kinds of problem, and are handled by one set of tools.
This lesson builds those tools. It assumes the algebra of the earlier lessons and the graphs of the previous one, and it produces the central fact about polynomials: a root and a factor are the same thing seen twice, so finding one is finding the other.
Degree, and what a polynomial is not
A polynomial in is a finite sum of terms with whole-number exponents and constant coefficients, such as . The largest exponent with a non-zero coefficient is the degree, and the coefficient sitting on it is the leading coefficient. Degree zero is a constant, one is linear, two quadratic, three cubic, four quartic.
The restriction to whole-number exponents is what makes the family well behaved, and it excludes a great deal. Neither , which is , nor , which is , is a polynomial, and neither is , where the variable is in the exponent rather than the base. Each of those three has its own lesson later in this course, and each behaves quite differently.
Adding two polynomials gives a polynomial whose degree is at most the larger of the two, and can be less when leading terms cancel. Multiplying gives one whose degree is exactly the sum, since the leading terms multiply and nothing else can reach that power. So degree behaves under multiplication the way exponents do, which is the first hint of the index laws that a later lesson makes general.
At large the leading term swamps everything else, and this settles the shape of the far ends of the graph. For at , the leading term is while the rest contributes , four per cent of the total, and the fraction shrinks as grows. So an odd-degree polynomial with positive leading coefficient falls without limit to the left and rises without limit to the right, and an even-degree one goes the same way at both ends.
Division with a remainder
Whole numbers can be divided with a remainder smaller than the divisor: . Polynomials do the same, with the degree of the remainder taking the place of the size: dividing by a non-zero gives a unique quotient and remainder with
where the degree of is less than the degree of . Dividing by a linear therefore leaves a remainder of degree zero, a plain number.
The procedure is long division, arranged like the arithmetic version. Divide by . The leading term divided by gives ; multiply by to get and subtract, leaving . Now divided by gives ; multiply and subtract, leaving . Finally divided by gives ; multiply and subtract, leaving . So the quotient is and the remainder is .
Multiplying back is the check, and it should always be done: , and adding the remainder recovers the original.
The remainder theorem, and why it is obvious in hindsight
There is a shortcut for the remainder that avoids the division entirely. Write the division statement for a linear divisor: , with a constant. This holds for every , so it holds at , where the first term dies:
The remainder on dividing by is simply . Checking against the division just done, , which is the remainder found the long way.
The factor theorem is the case , and it is the reason the whole apparatus matters. If then the remainder is zero, so divides exactly; and if divides exactly then . A number with is a root, and the theorem says roots and linear factors are two descriptions of one fact. Finding a root hands you a factor, and dividing by that factor leaves a polynomial of one lower degree, which is a smaller problem of the same kind.
Example. Show that is a root of , and factor it completely.
Evaluate: , so is a factor. Dividing gives , and that quadratic factors as , since and the middle term works out. So and the roots are , and . Check the middle one: .
Now you. Show that is a root of and factor it completely.
Answer
, so is a factor. Dividing gives , so and the roots are , and . Check: and .
Where to look for a root
The factor theorem is useless without a root to start from, and guessing is only tolerable if the guesses are few. The rational root theorem makes them few. If a polynomial with integer coefficients has a rational root in lowest terms, then divides the constant term and divides the leading coefficient.
For the constant is and the leading coefficient is , so the numerator is and the denominator is or . That is sixteen candidates rather than infinitely many, and the roots found above, , and , are all on the list as they must be.
The theorem is a genuine restriction and also a warning about how special rational roots are. Most polynomials with integer coefficients have none: has only , which is irrational, and the candidates all fail on inspection. Textbook exercises are chosen to have rational roots, and this creates a false impression that finding roots is a matter of persistence. In the wild it is not, and numerical methods do the work.
Multiplicity, and what the graph does
A factor can repeat. In the root has multiplicity two, and the graph shows the difference plainly: at a root of odd multiplicity the curve crosses the axis, and at a root of even multiplicity it touches and turns back. The reason is a sign argument. Near the factor is positive on both sides, so the sign of the product is controlled by alone and does not change; with a single factor the sign flips as passes through.
Counting roots with their multiplicities makes the bookkeeping come out right. A polynomial of degree has at most roots, because each root contributes a linear factor and the degrees of the factors must add to . It may have fewer real roots: has none, the gap left open in the first lesson, and has three while has one.
The fundamental theorem of algebra, proved by Gauss in his doctoral thesis of 1799 with several later and more rigorous proofs, says that over the complex numbers the count is always exact: every polynomial of degree has exactly roots counted with multiplicity. This is the payoff of the extension the first lesson declined to make. Admitting the solutions of does not merely patch that one equation, it makes every polynomial equation solvable at once, and no further extension is ever needed. On the real line the statement is weaker and messier, and the honest version is that the roots come in a bounded number and some of them may be missing.
Example. Factor completely and describe its graph.
The expression is a quadratic in , so treat : . Substituting back, . Four distinct roots, all of multiplicity one, so the curve crosses the axis at . The degree is even with a positive leading coefficient, so both ends rise, and the curve must therefore dip below the axis between and , rise above between and , and dip again between and .
Now you. Factor completely, given that is a root.
Answer
Dividing by gives , so the factorisation is and the roots are , and . Check in the original: .
Building a polynomial from what it must do
The correspondence runs both ways, which is how polynomials get used as models. If a cubic must vanish at , and , it is for some constant , and one further condition fixes .
Example. Find the cubic with roots , , passing through .
Write . At this is , and that must equal , so . Expanding, . Check at : .
Now you. Find the quadratic with roots and passing through .
Answer
, and at that is , so and .
The limits of exact solution
Everything above is exact, and it depends on someone handing over a root. When no rational root exists, degree three and four can still be solved in radicals by the formulas of Cardano and Ferrari, published in the Ars Magna of 1545, though the cubic formula is unpleasant enough that almost nobody uses it.
Beyond that the road ends. Ruffini argued in 1799 and Abel proved in 1824 that the general fifth-degree equation has no solution by radicals, and Galois in 1832 explained exactly which equations do and which do not, in work that founded modern algebra. This is not a gap awaiting a cleverer formula. It is a proof that no such formula can exist, and it is one of the places where mathematics stops offering better methods and starts explaining why a method is impossible.
What is left is numerical work, which is enough for every practical purpose: bisection, which uses the fact that a sign change traps a root, and faster iterative schemes built on the derivative. Those belong to calculus.
Polynomials share one further limitation, and it is the one that opens the next lesson. No polynomial doubles at fixed intervals. A quantity that grows by a fixed factor for each unit of time, as money at compound interest does and as a bacterial culture does, cannot be described by any of these functions, however high the degree. Describing it needs the variable in the exponent, which is where the family ends and a new one begins.