liveBook · Manning

Root

A polynomial root is a value in the relevant number system at which the polynomial evaluates to zero.

How 2 Manning books explain it

Geometry for Programmers

A polynomial root is a value of the variable at which the polynomial evaluates to zero.

How it is used
Locates zero values of polynomial equations and identifies x-axis intersections, extrema, and interpolation oscillations.
How deep it goes
Defines roots geometrically, classifies root counts by degree, and links derivative roots to extrema; it stops short of root-solving algorithms.
Examples
Uses factored cubics, linear graphs, quadratic parabolas, cubic graphs, and interpolating polynomials with increasing oscillations.
What you can do after
Evaluate polynomial graphs by identifying their roots, possible root counts, and relationships between derivative roots and extrema.

Read how Geometry for Programmers explains root →

Elliptic Curve Cryptography for Developers

A polynomial root is a value in the relevant algebraic structure that satisfies a polynomial equation by making it equal to zero.

How it is used
Uses roots to factor Hilbert class polynomials modulo a prime and construct finite-field extension elements.
How deep it goes
Explains direct linear and quadratic solutions plus recursive higher-degree splitting, while deferring complete implementation details.
Examples
Uses Hilbert class polynomials, zero-root division, linear and quadratic equations, and x² + 13x + 1 modulo 1187.
What you can do after
Apply modular factorization procedures to isolate roots and represent extension-field elements through irreducible polynomial equations.

Read how Elliptic Curve Cryptography for Developers explains root →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.