AngouriMath
RootCandidates(PeterO.Numbers.ERational[])
Method (no overloads)
Summary
Zero first, then the candidates of the rational root theorem, which cannot offer
it: they are built from divisors of the constant term, and a polynomial with a
root at zero has none.
it: they are built from divisors of the constant term, and a polynomial with a
root at zero has none.
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 1953 pages online