The polynomial degree of a nonzero univariate polynomial is its highest power, and is sometimes called its "order." For example, the polynomial
 |
has degree 
if its leading coefficient 
, denoted 
. The (structural) degree of a polynomial
is implemented in the Wolfram Language
as Exponent[poly,
x]. For a polynomial with coefficients
that are exact rational numbers, its degree is
computable by finding the highest power with a nonzero coefficient. Richardson's
theorem instead concerns zero testing for a richer class of elementary
functions.
