4.4/5 - (39 votes)

A young mathematician once proved that an entire category of equations can never be solved by any formula, no matter how clever, and more than two centuries later that limit still holds.

Polynomials look tame in a textbook, reduced to expressions you simplify and solve. The five facts below show how strange the rules around them actually get.

Dividing two polynomials rarely gives you another polynomial

It sounds like it should work the way whole numbers do. Divide one integer by another and you sometimes get a whole number back, sometimes a fraction.

Polynomials follow the same logic, except the fraction outcome is far more common. Divide most polynomials by another one and the result is what mathematicians call a rational function, not a polynomial at all.

A polynomial only stays a polynomial through addition, subtraction, and multiplication. Division breaks that pattern almost every time.

One polynomial has infinitely many solutions

Most polynomial equations have a fixed, countable number of solutions tied to their degree. A simple quadratic has at most two, a cubic has at most three, and so on.

There is exactly one exception: the polynomial that equals zero everywhere. It is the only single-variable polynomial with an infinite number of roots, which flatly contradicts the assumption that a polynomial always has a finite set of solutions.

Multiplying simple polynomials creates more terms than you would expect

Take two polynomials as ordinary as one with three terms and another with four. Multiplying them out looks like basic arithmetic, but it isn’t quite.

Every term in the first expression has to be multiplied by every term in the second. With just three terms on one side and four on the other, that is already twelve separate partial products before anything even gets combined.

See also  For four years, her math lectures were listed under a man's name

It is a small reminder that polynomial multiplication hides more combinatorial complexity than the tidy final answer ever lets on.

A shortcut from centuries ago still speeds up modern computers

Evaluating a polynomial by plugging in a number and multiplying out every term takes a lot of steps, and the workload grows fast as the degree increases.

A technique known as Horner’s method restructures that same calculation into a nested chain of simple operations, cutting the number of steps dramatically. It was refined for practical use in the 19th century, and it is still built into how computers evaluate polynomials today.

Some equations were mathematically proven unsolvable by any formula

For centuries, mathematicians assumed that every polynomial equation, no matter its degree, could eventually be cracked with the right formula. Equations of degree three and degree four already had one by the 16th century.

In 1824, Niels Henrik Abel proved that assumption wrong. He showed that equations of degree five have solutions that can never be captured by a finite formula using only arithmetic and radicals.

Six years later, Evariste Galois went even further, proving that most equations above degree four share the same fate. His work opened up entirely new fields of mathematics, including what is now called group theory.

What these quirks say about algebra class

None of this shows up in a typical algebra class, where polynomials are mostly treated as predictable expressions to simplify and solve. Even the word itself has a quiet backstory, stitched together in the 17th century from the Greek word for “many” and the Latin word for “name”.

See also  Lord Byron's daughter published the first computer program as AAL

In reality, polynomials sit at the edge of some of mathematics’ deepest unresolved questions, proof that even the most basic-looking expressions can hide two centuries of unfinished business.