      factor
      Copyright (c)  2013 John Abbott, Anna M. Bigatti
      GNU Free Documentation License, Version 1.2
%!includeconf: ../aux-txt2tags/config.t2t
      TeXTitle{factor}{John Abbott, Anna M. Bigatti}


== Examples ==[examples]
%----------------------------------------------------------------------
- [ex-factor.C ../../examples/index.html#ex-factor.C]
-

== User documentation ==
%======================================================================

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.


== Maintainer documentation ==
%======================================================================

Still only a prototype -- just uses old C4 code to do the work.


== Bugs, shortcomings and other ideas ==
%======================================================================

Still only a prototype -- just uses old C4 code to do the work.



== Main changes ==
%======================================================================

**2013**
- aprile (v0.9953): first doc



