Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools


Polynomial Equations



Definition and Degree
The Fundamental Theorem of Algebra
The Factor Theorem and Remainder Theorem
The Rational Root Theorem
Solving Cubic Equations
Solving Quartic Equations
Degree Five and Beyond
Root Multiplicity
Relationships Between Roots and Coefficients



Higher-Degree Equations and the Limits of Exact Solutions

Beyond degree two, polynomial equations grow rapidly in complexity. A cubic can have three real roots, a quartic four, and the pattern continues — the degree sets the ceiling on the number of solutions. Closed-form solutions exist for cubics and quartics, but they are unwieldy, and at degree five a hard theoretical barrier appears: no general formula in radicals can solve every polynomial equation of degree five or higher. What remains universal is the Fundamental Theorem of Algebra, which guarantees that the roots exist even when no formula can produce them, and a collection of techniques — the factor theorem, the rational root theorem, synthetic division — that reduce the problem piece by piece.



Definition and Degree

A polynomial equation in one variable has the general form

anxn+an−1xn−1+⋯+a1x+a0=0a_nx^n + a_{n-1}x^{n-1} + \cdots + a_1x + a_0 = 0


where an≠0a_n \neq 0 and nn is a positive integer. The integer nn is the degree of the equation, and ana_n is the leading coefficient. The coefficients a0,a1,…,ana_0, a_1, \dots, a_n are typically real numbers, though the theory extends naturally to complex coefficients.

Linear equations correspond to n=1n = 1 and quadratic equations to n=2n = 2. Both have complete, closed-form solutions and are treated on their own pages. This page addresses degree three and above, where new phenomena emerge: more roots, more intricate factorizations, and eventually the impossibility of a universal solving formula.

The degree governs the maximum number of roots. A polynomial of degree nn has at most nn real roots, and when counted with multiplicity over the complex numbers, it has exactly nn roots. A cubic may have one or three real roots, a quartic may have zero, two, or four, and the possible counts depend on the specific coefficients involved.

The Fundamental Theorem of Algebra

The Fundamental Theorem of Algebra states that every polynomial of degree n≥1n \geq 1 with complex coefficients has at least one root in C\mathbb{C}. Repeated application of this fact yields a stronger conclusion: every such polynomial has exactly nn roots in C\mathbb{C} when counted with multiplicity.

The consequence for factoring is immediate. A degree-nn polynomial P(x)P(x) with leading coefficient ana_n decomposes completely as

P(x)=an(x−r1)(x−r2)⋯(x−rn)P(x) = a_n(x - r_1)(x - r_2) \cdots (x - r_n)


where r1,r2,…,rnr_1, r_2, \dots, r_n are the nn roots (not necessarily distinct). Over the complex numbers, every polynomial splits into linear factors. No irreducible quadratic or higher-degree factors remain.

Over the real numbers, the picture is slightly different. Complex roots of a polynomial with real coefficients always appear in conjugate pairs: if r=a+bir = a + bi is a root, then r‾=a−bi\overline{r} = a - bi is also a root. Each conjugate pair combines into a quadratic factor x2−2ax+(a2+b2)x^2 - 2ax + (a^2 + b^2) with real coefficients and negative discriminant. A real polynomial therefore factors into a product of linear factors (from real roots) and irreducible quadratic factors (from conjugate pairs).

The Factor Theorem and Remainder Theorem

The Remainder Theorem connects evaluation and division: when a polynomial P(x)P(x) is divided by the binomial (x−r)(x - r), the remainder equals P(r)P(r). In symbols, P(x)=(x−r)Q(x)+P(r)P(x) = (x - r)Q(x) + P(r), where Q(x)Q(x) is the quotient polynomial of degree one less than P(x)P(x).

The Factor Theorem is the special case where P(r)=0P(r) = 0. If substituting rr into P(x)P(x) yields zero, then the remainder is zero, which means (x−r)(x - r) divides P(x)P(x) evenly. Conversely, if (x−r)(x - r) is a factor, then P(r)=0P(r) = 0. Finding roots and finding factors are two expressions of the same problem.

This connection creates a degree-reduction strategy. Once a root rr is identified — by inspection, by the rational root theorem, or by other means — dividing P(x)P(x) by (x−r)(x - r) produces a quotient Q(x)Q(x) of degree n−1n - 1. The roots of Q(x)Q(x) are the remaining roots of P(x)P(x). Repeating the process reduces the degree one step at a time until the quotient is quadratic, at which point the quadratic formula finishes the job.

Polynomial division can be carried out using long division or synthetic division. Synthetic division is faster but limited to divisors of the form (x−r)(x - r), which is exactly the form needed when factoring out a known root.

The Rational Root Theorem

The Rational Root Theorem narrows the search for rational roots of a polynomial with integer coefficients. It states: if pq\frac{p}{q} is a rational root in lowest terms, then pp divides the constant term a0a_0 and qq divides the leading coefficient ana_n.

This produces a finite, testable list of candidates. For the polynomial 2x3−3x2−8x+12=02x^3 - 3x^2 - 8x + 12 = 0, the constant term is 1212 and the leading coefficient is 22. The divisors of 1212 are ±1,±2,±3,±4,±6,±12\pm 1, \pm 2, \pm 3, \pm 4, \pm 6, \pm 12, and the divisors of 22 are ±1,±2\pm 1, \pm 2. The candidate rational roots are all fractions pq\frac{p}{q} formed from these:

±1,±2,±3,±4,±6,±12,±12,±32\pm 1, \pm 2, \pm 3, \pm 4, \pm 6, \pm 12, \pm \frac{1}{2}, \pm \frac{3}{2}


Testing x=2x = 2: P(2)=2(8)−3(4)−8(2)+12=16−12−16+12=0P(2) = 2(8) - 3(4) - 8(2) + 12 = 16 - 12 - 16 + 12 = 0. So x=2x = 2 is a root, (x−2)(x - 2) is a factor, and dividing reduces the cubic to a quadratic 2x2+x−6=02x^2 + x - 6 = 0, which the quadratic formula or further factoring can handle.

The theorem guarantees nothing about irrational or complex roots. A polynomial like x3−2=0x^3 - 2 = 0 has no rational roots at all — its only real root is 23\sqrt[3]{2}. The rational root theorem is a sieve, not a guarantee, and when every candidate fails, other methods are needed.

Solving Cubic Equations

A cubic equation ax3+bx2+cx+d=0ax^3 + bx^2 + cx + d = 0 can be transformed into a reduced (depressed) cubic by eliminating the x2x^2 term. The substitution x=t−b3ax = t - \frac{b}{3a} produces an equation of the form

t3+pt+q=0t^3 + pt + q = 0


where pp and qq depend on the original coefficients. This depressed form is the starting point for Cardano's formula, which expresses the roots through cube roots and square roots of expressions involving pp and qq.

Cardano's formula yields all three roots, but its practical use is limited. The expressions under the radicals often involve nested roots that are difficult to simplify. Worse, when all three roots are real — the so-called casus irreducibilis — the formula necessarily passes through complex intermediate values to reach real answers. The formula is correct but computationally awkward.

The practical approach to most cubics encountered in coursework begins with the rational root theorem. If a rational root exists, polynomial division reduces the cubic to a quadratic, and the remaining roots follow from the quadratic formula. When no rational root exists, numerical methods such as Newton's method or graphical estimation provide the real roots to any required precision.

Every cubic with real coefficients has at least one real root. This is a consequence of the intermediate value theorem: a real cubic changes sign as xx ranges from −∞-\infty to +∞+\infty, so it must cross zero somewhere.

Solving Quartic Equations

A quartic equation ax4+bx3+cx2+dx+e=0ax^4 + bx^3 + cx^2 + dx + e = 0 is the highest degree for which a general closed-form solution in radicals exists. Ferrari's method, developed in the sixteenth century, reduces the quartic to a resolvent cubic. Solving the cubic provides a key quantity that splits the quartic into two quadratics, each solvable by the quadratic formula.

The procedure works in full generality, but the algebra is heavy. Even for modest numerical examples, the resolvent cubic and the subsequent quadratic splitting produce expressions that are lengthy to simplify by hand. For this reason, Ferrari's method is more important as a theoretical milestone than as a practical tool.

In practice, quartic equations that appear in coursework are usually structured to admit simpler approaches. Bi-quadratic equations ax4+bx2+c=0ax^4 + bx^2 + c = 0 reduce directly to quadratics via the substitution u=x2u = x^2. Quartics with a rational root are handled by the rational root theorem and degree reduction. Quartics that factor into two quadratics — recognizable by grouping or by inspection — split without invoking the full Ferrari machinery.

A quartic with real coefficients can have zero, two, or four real roots. Unlike cubics, a quartic is not guaranteed to have any real roots at all.

Degree Five and Beyond

The Abel–Ruffini theorem, proved in the early nineteenth century, establishes that no formula composed of arithmetic operations and radicals can solve every polynomial equation of degree five or higher. This does not mean that specific quintic equations are unsolvable — many factor, many have rational roots, and many yield to substitution. It means that no single formula analogous to the quadratic formula exists that accepts five arbitrary coefficients and returns the roots.

The impossibility is not a matter of insufficient ingenuity. Galois theory provides the precise criterion: a polynomial equation is solvable by radicals if and only if its Galois group is a solvable group. The symmetric group SnS_n is solvable for n≤4n \leq 4 and not solvable for n≥5n \geq 5, which is why degree four is the last degree admitting a universal radical formula.

For equations of any degree, the practical toolkit consists of the rational root theorem (to find and factor out rational roots), synthetic division (to reduce the degree step by step), and the quadratic formula (to handle the final quadratic quotient). When these algebraic tools run out — when no rational roots exist and no convenient factorization appears — numerical methods step in. Newton's method, the bisection method, and related algorithms approximate real roots to arbitrary precision, and these are the techniques actually used in computation for large-degree polynomials.

Root Multiplicity

A root rr of the polynomial P(x)P(x) has multiplicity kk if (x−r)k(x - r)^k divides P(x)P(x) but (x−r)k+1(x - r)^{k+1} does not. A root of multiplicity 11 is called a simple root, multiplicity 22 a double root, multiplicity 33 a triple root, and so on.

The sum of all multiplicities across all roots equals the degree of the polynomial. The equation x3−3x2+3x−1=0x^3 - 3x^2 + 3x - 1 = 0 factors as (x−1)3=0(x - 1)^3 = 0, so x=1x = 1 is a triple root and the three roots (counted with multiplicity) are all equal to 11.

Multiplicity has both algebraic and geometric significance. Algebraically, it affects how the root behaves under perturbation: a simple root of P(x)=0P(x) = 0 moves smoothly when the coefficients change slightly, while a multiple root tends to split into several nearby roots. Geometrically, multiplicity determines how the graph of y=P(x)y = P(x) interacts with the xx-axis at the root. At a simple root, the graph crosses the axis cleanly. At a double root, the graph touches the axis and turns back without crossing — the root is a local extremum. At a triple root, the graph crosses the axis but flattens as it does so, producing an inflection point on the axis.

The general pattern is: odd multiplicity means the graph crosses the axis, even multiplicity means it touches and reverses direction. Higher multiplicity in either case means greater flattening at the crossing or touching point.

Relationships Between Roots and Coefficients

Vieta's formulas, introduced for the quadratic case on the quadratic equations page, extend to polynomials of any degree. For the monic polynomial xn+an−1xn−1+⋯+a1x+a0=0x^n + a_{n-1}x^{n-1} + \cdots + a_1x + a_0 = 0 with roots r1,r2,…,rnr_1, r_2, \dots, r_n, the coefficients encode symmetric combinations of the roots:

r1+r2+⋯+rn=−an−1r_1 + r_2 + \cdots + r_n = -a_{n-1}


r1r2+r1r3+⋯+rn−1rn=an−2r_1 r_2 + r_1 r_3 + \cdots + r_{n-1}r_n = a_{n-2}


r1r2r3+⋯=−an−3r_1 r_2 r_3 + \cdots = -a_{n-3}


continuing with alternating signs down to

r1⋅r2⋯rn=(−1)na0r_1 \cdot r_2 \cdots r_n = (-1)^n a_0


Each formula equates a coefficient to an elementary symmetric polynomial in the roots. The first gives the sum of all roots, the second the sum of all pairwise products, the third the sum of all triple products, and the last the product of all roots.

These relationships hold whether the roots are real or complex, rational or irrational. They allow certain questions about the roots to be answered without solving: the sum and product of the roots are readable directly from the coefficients. For a non-monic polynomial anxn+⋯+a0=0a_n x^n + \cdots + a_0 = 0, dividing through by ana_n first converts it to monic form, or equivalently, each formula acquires ana_n in its denominator.