Polynomial Degree

The highest power in a univariate polynomial is known as its degree, or sometimes "order." For example, the polynomial

is of degree 👁 n
, denoted 👁 degP(x)=n
. The (structural) degree of a polynomial is implemented in the Wolfram Language as [poly, x]. Richardson's theorem proves that it is recursively undecidable to determine the degree of an arbitrary polynomial.

See also

Degree, Polynomial, Polynomial Order, Richardson's Theorem

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Polynomial Degree." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PolynomialDegree.html

Subject classifications