17.1 Fundamental Theorem of Algebra, Remainder/Factor Theorems & Polynomial Roots
Key Takeaways
- The Division Algorithm expresses any polynomial as P(x) = D(x)Q(x) + R(x), directly establishing the Remainder Theorem (P(c) is the remainder R when dividing by x - c) and the Factor Theorem ((x - c) is a factor if and only if P(c) = 0).
- The Fundamental Theorem of Algebra guarantees that every degree n >= 1 complex polynomial has exactly n complex zeros when counted with multiplicity, and non-real complex zeros must occur in conjugate pairs (a +/- bi) for polynomials with real coefficients.
- The Rational Root Theorem restricts all candidate rational zeros of an integer-coefficient polynomial to p/q, where p divides constant term a0 and q divides leading coefficient an.
- Descartes' Rule of Signs establishes that the number of positive real zeros equals the sign variations in P(x) (or less by an even integer), while negative real zeros equal the sign variations in P(-x) (or less by an even integer).
- Zero multiplicity dictates local graph geometry: roots of odd multiplicity cross the x-axis (linear crossing for multiplicity 1, horizontal inflection for multiplicity >= 3), whereas roots of even multiplicity touch and turn around; global end behavior is dictated entirely by leading term an*x^n.
17.1 Fundamental Theorem of Algebra, Remainder/Factor Theorems & Polynomial Roots
The Division Algorithm, Synthetic Division, and the Remainder and Factor Theorems
Polynomial functions form the backbone of precalculus and higher analysis. The fundamental theorem governing their algebraic factorization is the Division Algorithm for Polynomials: for any polynomial dividend $P(x)$ and non-zero divisor $D(x)$, there exist unique polynomials $Q(x)$ (the quotient) and $R(x)$ (the remainder) such that: where either $R(x) = 0$ or the degree of $R(x)$ is strictly less than the degree of $D(x)$ ($\deg(R) < \deg(D)$).
When the divisor is a linear binomial of the form $D(x) = x - c$, the remainder $R(x)$ must have degree $0$, meaning it is a constant $R$. Substituting $x = c$ into the division identity yields: This result is the Remainder Theorem: when a polynomial $P(x)$ is divided by $x - c$, the remainder is the function value $P(c)$.
A direct corollary is the Factor Theorem: the binomial $(x - c)$ is a factor of the polynomial $P(x)$ if and only if $P(c) = 0$. Consequently, four mathematical statements are logically equivalent:
- $x = c$ is a root (or solution) of the polynomial equation $P(x) = 0$.
- $x = c$ is a zero of the polynomial function $P(x)$.
- $(x - c)$ is a linear factor of the polynomial $P(x)$.
- The point $(c, 0)$ is an $x$-intercept of the graph of $y = P(x)$.
To divide by $x - c$ rapidly without tedious polynomial long division, we use synthetic division. In synthetic division, we record the divisor's zero $c$ in the left box and align the coefficients of $P(x)$ horizontally in descending degree order, placing an explicit $0$ for any missing term. We drop the leading coefficient, multiply it by $c$, add the product to the next column's coefficient, and repeat down the line. The final calculated value is the remainder $P(c)$, while the preceding numbers represent the coefficients of the quotient polynomial $Q(x)$ of degree $n - 1$.
Fundamental Theorem of Algebra and the Complex Conjugate Root Theorem
The existence and enumeration of polynomial roots is codified by the Fundamental Theorem of Algebra (first proved rigorously by Carl Friedrich Gauss): every non-zero single-variable polynomial $P(x)$ of degree $n \ge 1$ with complex coefficients possesses at least one complex zero.
Applying the Factor Theorem iteratively to each guaranteed zero produces the Linear Factorization Theorem: every polynomial of degree $n \ge 1$ can be factored completely into exactly $n$ linear complex factors: where $a_n$ is the non-zero leading coefficient and $r_1, r_2, \dots, r_n$ are complex numbers (not necessarily distinct). Counting each distinct root according to its algebraic multiplicity $k$, a polynomial of degree $n$ has exactly $n$ complex roots ($\sum k_i = n$).
When the coefficients of $P(x)$ are restricted to the real numbers ($\mathbb{R}$), non-real complex roots exhibit symmetry governed by the Complex Conjugate Root Theorem: if $P(x)$ is a polynomial with real coefficients and $z = a + bi$ ($b \neq 0$) is a root of $P(x) = 0$, then its complex conjugate $\bar{z} = a - bi$ is also a root of $P(x) = 0$.
Because non-real roots occur in conjugate pairs, their corresponding linear factors multiply together into an irreducible quadratic factor with real coefficients: The discriminant of this quadratic is $\Delta = (-2a)^2 - 4(1)(a^2 + b^2) = 4a^2 - 4a^2 - 4b^2 = -4b^2 < 0$. An immediate and powerful deduction tested on the FTCE Mathematics 6-12 exam is that every polynomial of odd degree with real coefficients must have at least one real zero, because all non-real zeros must occur in even pairs.
Rational Root Theorem and Descartes' Rule of Signs
When searching for roots of a polynomial with integer coefficients $P(x) = a_n x^n + a_{n-1}x^{n-1} + \dots + a_1 x + a_0$ where $a_n \neq 0$ and $a_0 \neq 0$, the search space of rational candidates is strictly bounded by the Rational Root Theorem: if a rational number $\frac{p}{q}$ (written in lowest terms such that $\gcd(p, q) = 1$) is a zero of $P(x)$, then:
- $p$ must be an integer factor of the constant term $a_0$.
- $q$ must be an integer factor of the leading coefficient $a_n$.
To narrow down the potential candidates, we apply Descartes' Rule of Signs:
- Positive Real Zeros: The number of positive real zeros of $P(x)$ is either equal to the number of sign variations between consecutive non-zero coefficients of $P(x)$, or is less than that count by an even integer ($v, v-2, v-4, \dots$).
- Negative Real Zeros: The number of negative real zeros of $P(x)$ is either equal to the number of sign variations between consecutive non-zero coefficients of $P(-x)$, or is less than that count by an even integer.
By tabulating the possible combinations of positive real, negative real, and non-real complex zeros, an examinee can systematically identify roots using synthetic division without guessing blindly.
Zero Multiplicity and Graph End Behavior
When a polynomial is factored into $(x - r)^k$, the integer exponent $k$ represents the multiplicity of the zero $r$. Multiplicity dictates the local topological behavior of the graph of $P(x)$ as it interacts with the $x$-axis at $(r, 0)$:
- Odd Multiplicity ($k = 1$): The graph crosses the $x$-axis transversally (cutting through the axis linearly with non-zero instantaneous slope).
- Odd Multiplicity ($k \ge 3$): The graph crosses the $x$-axis while flattening out, creating an inflection point with a horizontal tangent at $(r, 0)$.
- Even Multiplicity ($k = 2, 4, 6, \dots$): The graph touches the $x$-axis and turns around (rebounds) without crossing, forming a local extremum tangent to the axis.
While multiplicity governs local zero behavior, the Leading Coefficient Test governs global end behavior as $x \to \pm\infty$. For $P(x) = a_n x^n + \dots + a_0$, the leading term $a_n x^n$ dominates all other terms asymptotically:
- Even Degree ($n$ even), $a_n > 0$: Rises left and right ($\lim_{x \to \pm\infty} P(x) = +\infty$).
- Even Degree ($n$ even), $a_n < 0$: Falls left and right ($\lim_{x \to \pm\infty} P(x) = -\infty$).
- Odd Degree ($n$ odd), $a_n > 0$: Falls left, rises right ($\lim_{x \to -\infty} P(x) = -\infty$, $\lim_{x \to +\infty} P(x) = +\infty$).
- Odd Degree ($n$ odd), $a_n < 0$: Rises left, falls right ($\lim_{x \to -\infty} P(x) = +\infty$, $\lim_{x \to +\infty} P(x) = -\infty$).
Furthermore, a polynomial of degree $n$ has at most $n$ real zeros and at most $n - 1$ turning points (local extrema).
Polynomial Theorems and Properties Reference
| Theorem / Rule | Mathematical Statement | Operational Application |
|---|---|---|
| Division Algorithm | $P(x) = D(x)Q(x) + R(x)$ with $\deg(R) < \deg(D)$ | Establishes uniqueness of polynomial quotient and remainder |
| Remainder Theorem | Dividing $P(x)$ by $(x - c)$ yields remainder $R = P(c)$ | Evaluates $P(c)$ efficiently via synthetic division substitution |
| Factor Theorem | $(x - c)$ divides $P(x) \iff P(c) = 0$ | Converts functional zeros into linear binomial factors |
| Fundamental Theorem of Algebra | Degree $n \ge 1$ has at least one complex zero | Guarantees exactly $n$ linear factors over $\mathbb{C}$ counting multiplicity |
| Complex Conjugate Root Theorem | Real coefficients: $P(a + bi) = 0 \implies P(a - bi) = 0$ | Couples non-real roots into irreducible quadratic factors $x^2 - 2ax + (a^2+b^2)$ |
| Rational Root Theorem | Rational zero $p/q \implies p \mid a_0$ and $q \mid a_n$ | Produces a finite candidate list of potential rational roots |
| Descartes' Rule of Signs | Positive: sign variations in $P(x)$; Negative: variations in $P(-x)$ | Bounds the count of positive and negative real roots by parity |
Worked Exemplar: Complete Factorization and Root Characterization
Problem: Find all complex zeros, write the complete linear factorization, and describe the graph end behavior of the polynomial $P(x) = 2x^4 - 3x^3 - 7x^2 + 12x - 4$.
-
List Candidate Rational Roots: The constant term is $a_0 = -4$ with factors $p \in {\pm 1, \pm 2, \pm 4}$. The leading coefficient is $a_4 = 2$ with factors $q \in {\pm 1, \pm 2}$. Candidate rational roots are $\frac{p}{q} \in {\pm 1, \pm \frac{1}{2}, \pm 2, \pm 4}$.
-
Apply Descartes' Rule of Signs:
- Signs of $P(x)$: $(+, -, -, +, -)$ has 3 sign changes (from $+2$ to $-3$, $-7$ to $+12$, and $+12$ to $-4$). Thus, there are 3 or 1 positive real zeros.
- Signs of $P(-x) = 2x^4 + 3x^3 - 7x^2 - 12x - 4$: $(+, +, -, -, -)$ has 1 sign change (from $+3$ to $-7$). Thus, there is exactly 1 negative real zero.
-
Test Candidates Using Synthetic Division: Testing $x = 1$:
1 & 2 & -3 & -7 & 12 & -4 \\ & & 2 & -1 & -8 & 4 \\ \hline & 2 & -1 & -8 & 4 & 0 \end{array}$$ The remainder is $0$, confirming $x = 1$ is a zero. The depressed cubic quotient is $Q_1(x) = 2x^3 - x^2 - 8x + 4$. -
Factor the Depressed Cubic: Factor by grouping:
-
State Complete Factorization and Zeros: The four zeros are $x = 1, \frac{1}{2}, 2, -2$. There are 3 positive real zeros ($1, \frac{1}{2}, 2$), 1 negative real zero ($-2$), and 0 non-real complex zeros, perfectly aligning with Descartes' Rule of Signs. Because each zero has multiplicity 1, the graph crosses the $x$-axis transversally at each intercept. With degree $n = 4$ (even) and leading coefficient $a_4 = 2 > 0$, the graph rises to $+\infty$ on both ends.
A polynomial function is defined by P(x) = 3x^4 - 5x^3 + 4x - 7. What is the remainder when P(x) is divided by x + 2?
A monic polynomial P(x) with real coefficients has degree 4. Two of its zeros are x = 3 (with multiplicity 2) and x = 2 - i*sqrt(5). What is the polynomial P(x) in standard expanded form?
According to Descartes' Rule of Signs, what are the possible combinations of real and non-real complex zeros for the polynomial function f(x) = 2x^4 - 5x^3 - x^2 + 7x - 6?
A structural engineer analyzes the deflection profile of a support beam modeled by the polynomial function P(x) = -2(x + 3)^3 * (x - 1)^2 * (x - 4). Which statement accurately describes the geometric behavior of the graph of P(x)?