# RealPolynomialUtilitiesPackage(TheField, ThePols)¶

boundOfCauchy(p) bounds the roots of p
lazyVariations(l, s1, sn) is the number of sign variations in the list of non null numbers [s1::l]@sn,
sturmSequence(p) = sylvesterSequence(p, p')
sturmVariationsOf(l) is the number of sign variations in the list of numbers l, note that the first term counts as a sign
sylvesterSequence(p, q) is the negated remainder sequence of p and q divided by the last computed term