Returns a positive integer N such that $\&verbar;r\&verbar;<N$ for all complex roots r of p.  In general, this bound is better than Cauchy's bound of

$⌈1+\frac{\mathrm{maxnorm}\left(p\right)}{\left|\mathrm{lcoeff}\left(p\right)\right|}⌉$.

$p≔x\&rarr;x^4-10x^2\&plus;1\&colon;$

$\mathrm{rootbound}\left(p\left(x\right)\&comma;x\right)$

$4$

$\mathrm{ceil}\left(1\&plus;\frac{\mathrm{maxnorm}\left(p\left(x\right)\right)}{\left|\mathrm{lcoeff}\left(p\left(x\right)\right)\right|}\right)$

$11$

$\mathrm{fsolve}\left(p\left(x\right)\&equals;0\&comma;x\right)$

$\mathrm{-3.146264370},\mathrm{-0.3178372452},0.3178372452,3.146264370$

$q≔x\&rarr;\left(x-3.2\right)\left(x-2.5\right)\left(x-0.3\right)\left(x\&plus;1.3\right)\left(x\&plus;2.5\right)\left(x\&plus;3.6\right)\&colon;$

$\mathrm{rootbound}\left(q\left(x\right)\&comma;x\right)$

$6$

$\mathrm{ceil}\left(1\&plus;\frac{\mathrm{maxnorm}\left(\mathrm{expand}\left(q\left(x\right)\right)\right)}{\left|\mathrm{lcoeff}\left(q\left(x\right)\right)\right|}\right)$

$78$

Monagan, M.B. "A Heuristic Irreducibility Test for Univariate Polynomials." J. of Symbolic Comp. Vol. 13 No. 1. Academic Press, (1992): 47-57.