Polynomials and Polynomial Arithmetic

⚡ Key Takeaways

A polynomial is a finite sum of terms, each a constant times a non-negative integer power of a variable, e.g. $3x^2 - 5x + 7$ . They can be added, subtracted, multiplied, and divided (with remainder) much like integers. Polynomials are foundational across algebra, calculus, computer science, and physics — used by mathematicians since at least the 9th century (al-Khwārizmī) and formalized over the centuries that followed.

💡 The Core Insight

A polynomial is completely determined by its finite list of coefficients. Therefore all polynomial arithmetic is bookkeeping on coefficient lists: addition combines coefficients of like powers, multiplication is a "convolution" of the two lists, and division produces a quotient and a remainder exactly as long division does for whole numbers. Treating polynomials as objects (not just functions to be evaluated) unlocks factoring, root-finding, and the entire algebraic machinery built on them.

DefinitionPolynomial in One Variable

A polynomial in the variable $x$ over a coefficient set $\mathbb{F}$ (the field of coefficients, such as $\mathbb{Q}$ , $\mathbb{R}$ , or $\mathbb{C}$ ) is an expression

1

\quad p(x) = a_n x^n + a_{n-1}x^{n-1} + \cdots + a_1 x + a_0 = \sum_{k=0}^{n} a_k x^k

Derivation hint: This is the definition itself — sigma notation just abbreviates the finite sum, with $x^0 = 1$ so $a_0$ is the constant term. Where the symbols mean:

$x$ — the variable (or indeterminate), a placeholder.
$a_k \in \mathbb{F}$ — the coefficients; $a_k$ multiplies $x^k$ .
$a_0$ — the constant term.
$n$ — the degree of $p$ , written $\deg p$ , provided the leading coefficient $a_n \neq 0$ .
$a_n x^n$ — the leading term; if $a_n = 1$ the polynomial is monic.

The zero polynomial $p(x) = 0$ has, by convention, degree $-\infty$ (or "undefined"). A polynomial of degree 0 is a nonzero constant; degree 1 is linear; degree 2 quadratic; degree 3 cubic; degree 4 quartic; degree 5 quintic.

DefinitionThe Four Arithmetic Operations

Given $p(x) = \sum_k a_k x^k$ and $q(x) = \sum_k b_k x^k$ :

Addition / Subtraction (combine like powers):

2

\quad (p \pm q)(x) = \sum_{k} (a_k \pm b_k)\, x^k

Derivation hint: Group terms with the same exponent — this is just the distributive and commutative laws applied to a finite sum.

Multiplication (each term times each term, then collect — a convolution):

3

\quad (p \cdot q)(x) = \sum_{m=0}^{\deg p + \deg q} c_m x^m, \qquad c_m = \sum_{i+j=m} a_i\, b_j

Derivation hint: Expand $\big(\sum a_i x^i\big)\big(\sum b_j x^j\big)$ by distributivity; the coefficient of $x^m$ collects every product $a_i b_j$ where $i+j=m$ .

TheoremDegree Rules

For nonzero polynomials over a field,

4

\quad \deg(p \cdot q) = \deg p + \deg q, \qquad \deg(p \pm q) \le \max(\deg p, \deg q)

Derivation hint: The top power of the product is $a_n b_m x^{n+m}$ with $a_n b_m \neq 0$ since a field has no zero divisors; addition cannot raise the top power but may cancel it.

TheoremDivision Algorithm for Polynomials

For any polynomials $p(x)$ (the dividend) and $d(x) \neq 0$ (the divisor) over a field, there exist unique polynomials $q(x)$ (quotient) and $r(x)$ (remainder) with

5

\quad p(x) = d(x)\,q(x) + r(x), \qquad r(x) = 0 \ \text{ or } \ \deg r < \deg d

Derivation hint: Repeatedly subtract a multiple of $d$ that cancels the current leading term of $p$ ; the degree strictly drops each step, so the process terminates. Uniqueness follows because two valid remainders would differ by a multiple of $d$ yet have degree below $\deg d$ .

TheoremRemainder and Factor Theorems

For a polynomial $p(x)$ and a constant $c$ :

6

\quad p(x) = (x-c)\,q(x) + p(c)

so the remainder upon dividing by $(x-c)$ is just $p(c)$ . Consequently $(x-c)$ is a factor of $p$ if and only if $p(c)=0$ (i.e. $c$ is a root). Derivation hint: Apply [5] with $d(x)=x-c$ ; the remainder $r$ has degree $<1$ , so it is a constant $r$ . Substituting $x=c$ gives $p(c) = 0\cdot q(c) + r$ , hence $r = p(c)$ .

ProofPolynomial Long Division — Existence of Quotient and Remainder

We prove [5] constructively for $p(x)$ of degree $n$ and $d(x)$ of degree $m$ with leading coefficient $b_m$ . 1. If $\deg p < \deg d$ , take $q(x)=0$ and $r(x)=p(x)$ . Done. 2. Otherwise ( $n \ge m$ ), form the term $t(x) = \dfrac{a_n}{b_m}\, x^{n-m}$ . 3. The product $t(x)\,d(x)$ has leading term $\dfrac{a_n}{b_m} x^{n-m}\cdot b_m x^m = a_n x^n$ , matching the leading term of $p$ . 4. The difference $p_1(x) = p(x) - t(x)\,d(x)$ therefore has the $x^n$ term cancelled, so $\deg p_1 < n$ . 5. Repeat steps 2–4 on $p_1$ , accumulating the $t$ -terms into the quotient $q(x)$ . Since each step strictly lowers the degree, after finitely many steps the running remainder has degree $< m$ . Call it $r(x)$ . 6. Summing the accumulated relations gives $p(x) = d(x)\,q(x) + r(x)$ with $\deg r < \deg d$ . $\blacksquare$

Uniqueness: Suppose $p = dq_1 + r_1 = dq_2 + r_2$ . Subtracting, $d(q_1-q_2) = r_2 - r_1$ . The right side has degree $< m$ ; the left side, if $q_1 \neq q_2$ , has degree $\ge m$ — a contradiction unless both sides are zero. Hence $q_1=q_2$ and $r_1=r_2$ .

∎

mathematician · Évariste Galois | 1811–1832

Though polynomial arithmetic is ancient, the deepest understanding of which polynomials can be solved by radicals came from Galois, who died in a duel at 20. He showed that to each polynomial equation one can attach a group of symmetries of its roots, and that solvability by formula corresponds to a special ("solvable") structure of that group. This explained why the quintic ( $\deg 5$ ) has no general radical formula while degrees 1–4 do, founding modern algebra in the process — built directly atop the arithmetic of polynomials described here.

🧠 Intuition

Think of a polynomial as a base- $x$ number whose "digits" are the coefficients, except the digits can be any size and even negative. Then:

Adding polynomials = adding digit-by-digit with no carrying (because $x$ is a symbol, not the fixed value 10).
Multiplying polynomials = exactly the grade-school multiplication grid, again without carries — each diagonal of the grid becomes one coefficient $c_m$ .
Dividing polynomials = long division you already know, lined up by powers of $x$ .

The absence of carrying is precisely what makes polynomial arithmetic cleaner than integer arithmetic, and why algorithms (and the roots that come from setting $p(x)=0$ ) behave so predictably. The graph of a polynomial is a smooth, unbroken curve whose degree caps how many times it can cross the $x$ -axis and how many "wiggles" (turning points, at most $n-1$ ) it can have.

Figure

Graphs of polynomials by degree: each crosses the x-axis at most "degree" times.

ExampleMultiplying and Collecting Like Terms

Given: $p(x) = 2x^2 - 3x + 1$ and $q(x) = x^2 + 4x - 5$ . Find $p(x)\cdot q(x)$ .

Steps — apply [3], multiplying each term of $p$ by each term of $q$ :

	$x^2$	$+4x$	$-5$
$2x^2$	$2x^4$	$8x^3$	$-10x^2$
$-3x$	$-3x^3$	$-12x^2$	$15x$
$+1$	$x^2$	$4x$	$-5$

Collect by power (the convolution $c_m = \sum_{i+j=m} a_i b_j$ ):

$x^4$ : $2$
$x^3$ : $8 - 3 = 5$
$x^2$ : $-10 - 12 + 1 = -21$
$x^1$ : $15 + 4 = 19$
$x^0$ : $-5$

Degree check via [4]: $\deg p + \deg q = 2 + 2 = 4$ . ✓

\boxed{p(x)\cdot q(x) = 2x^4 + 5x^3 - 21x^2 + 19x - 5}

ExampleLong Division with Remainder, then Confirming a Root

Given: Divide $p(x) = 2x^3 - 5x^2 + 3x - 4$ by $d(x) = x - 2$ , then state $p(2)$ .

Steps (polynomial long division, lining up powers): 1. $2x^3 \div x = 2x^2$ . Subtract $2x^2(x-2)=2x^3-4x^2$ : remainder $-x^2 + 3x - 4$ . 2. $-x^2 \div x = -x$ . Subtract $-x(x-2) = -x^2 + 2x$ : remainder $x - 4$ . 3. $x \div x = 1$ . Subtract $1\cdot(x-2)=x-2$ : remainder $-2$ . So $q(x) = 2x^2 - x + 1$ and $r = -2$ :

2x^3 - 5x^2 + 3x - 4 = (x-2)(2x^2 - x + 1) - 2

By the Remainder Theorem [6], the remainder equals $p(2)$ . Check directly: $p(2) = 2(8) - 5(4) + 3(2) - 4 = 16 - 20 + 6 - 4 = -2$ . ✓ Because $r = -2 \neq 0$ , $(x-2)$ is not a factor; $x=2$ is not a root.

\boxed{q(x) = 2x^2 - x + 1, \quad r = -2 = p(2)}

⚠️ Common mistake

Pitfalls that quietly produce wrong answers:

$\sqrt{x}$ , $x^{-1}$ , $2^x$ , and $\frac{1}{x+1}$ are not polynomials — exponents must be non-negative integers, and the variable may not sit in a denominator or under a root.
$(p+q)^2 \neq p^2 + q^2$ . The cross term matters: $(a+b)^2 = a^2 + 2ab + b^2$ .
"Degree of a sum equals the max degree" can fail when leading terms cancel — that is why [4] uses $\le$ for sums.
When dividing, you must include placeholder zeros for missing powers (e.g. write $x^3 + 0x^2 + 0x - 1$ ), or the columns misalign.
A polynomial of degree $n$ has at most $n$ real roots, but possibly fewer real roots (some may be complex or repeated).

Counterexample

Claim: "Adding two degree-3 polynomials gives a degree-3 polynomial." Take $p(x) = x^3 + x$ and $q(x) = -x^3 + 2$ . Then

p(x) + q(x) = x + 2,

which has degree 1, not 3 — the leading terms cancelled. This is exactly why the degree rule for addition in [4] is an inequality, never an equality.

connection

Polynomial arithmetic is a hub connecting many areas:

The set of polynomials forms a ring (closed under $+,-,\times$ with the [5] division algorithm), structurally parallel to the integers — see Ring Theory and Euclidean Domains.
Setting $p(x)=0$ leads to Roots of Polynomials and the Fundamental Theorem of Algebra.
Breaking polynomials into irreducible pieces is Factoring Polynomials, the analog of prime factorization.
The special case $\deg 2$ is governed by The Quadratic Formula and Completing the Square.
Derivatives and integrals of polynomials are the easiest cases in Differential Calculus and connect to Taylor Series, where general functions are approximated by polynomials.
Multiplication-as-convolution [3] links directly to Discrete Convolution and the Fast Fourier Transform used to multiply huge polynomials quickly.

🔬 Where this appears

⏳ History

- c. 1650 BCE — The Egyptian Rhind Papyrus and Babylonian clay tablets solve quadratic-type problems geometrically, without symbolic notation.

- c. 250 CE — Diophantus of Alexandria's Arithmetica introduces syncopated (abbreviated) notation for unknowns and powers — a step toward polynomial symbolism.

- c. 820 CE — Al-Khwārizmī's al-Jabr systematizes solving linear and quadratic equations, giving algebra its name and its method of "balancing."

- 1545 — Gerolamo Cardano publishes Ars Magna with general solutions to the cubic (from Tartaglia/del Ferro) and quartic (Ferrari), pushing arithmetic of higher-degree polynomials.

- 1591 — François Viète introduces letters for both knowns and unknowns, the birth of true symbolic algebra and coefficient manipulation.

- 1637 — René Descartes' La Géométrie fixes much of our modern notation (

x^2

,

x^3

) and links polynomials to curves via coordinates.

- 1799 — Carl Friedrich Gauss gives the first rigorous proof of the Fundamental Theorem of Algebra: every degree-

n

polynomial has

n

complex roots.

- 1824 / 1832 — Niels Abel proves the general quintic is unsolvable by radicals; Évariste Galois explains why via group theory.

- 1965 — Cooley & Tukey publish the Fast Fourier Transform, dramatically speeding up the multiplication of large polynomials (and integers) in computing.

open-problem

Several deep questions about polynomials remain hard or open:

Factoring difficulty: While factoring polynomials over the rationals is algorithmically solvable, integer factorization (a special multivariate-style problem) underlies RSA cryptography, and its hardness is unproven.
Sparse polynomials: Detecting whether a polynomial given in compact "sparse" form is identically zero, or counting its real roots efficiently, raises subtle complexity questions still under study.
Hilbert's Tenth Problem (resolved 1970): There is no algorithm to decide whether an arbitrary multivariable polynomial equation has integer solutions — a striking limit on what polynomial arithmetic can ultimately settle.
Open: Sendov's conjecture (proved for high degree only recently) and questions on the distribution of roots of random polynomials remain active research.

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also