AngouriMath
FactorSquareFree(AngouriMath.Functions.IntegerPolynomial)
Method (no overloads)
Summary
The irreducible factors of a primitive square-free integer polynomial.
Remarks
A leading coefficient other than one is cleared first, by the substitution that
turnsf of degree n into the monic
lc^(n-1) * f(x / lc) . Everything below it can then assume monic input,
which is what makes the Hensel step below keep the degrees it starts with. The
factors come back through the inverse substitution, and their primitive parts are
the factors of the original — Gauss's lemma is what makes that last step legal.
turns
which is what makes the Hensel step below keep the degrees it starts with. The
factors come back through the inverse substitution, and their primitive parts are
the factors of the original — Gauss's lemma is what makes that last step legal.
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online