There are several functions for computing factorizations of ring elements. The factorizations produced have different properties.
factor(f)
factorization into irreducibles
SqFreeFactor(f)
factorization into coprime squarefree factors
ContentfreeFactor(f)
polynomial factorization into (coprime) content-free factors
The irreducible factorization of a polynomial with rational coefficients produces factors with integer coefficients (and integer content = 1) having positive leading coefficient. The remaining factor is the unique rational number (actually a polynomial of degree 0) which makes the factorization correct.
Still only a prototype -- just uses old C4 code to do the work.
Still only a prototype -- just uses old C4 code to do the work.
2013