Squarefree factorization is a first step in many factorization algorithms. It factors nonsquarefree polynomials in terms of squarefree factors that are relatively prime. It can separate factors of different multiplicities, but not factors with the same multiplicity. One way to find a squarefree factorization is to compute polynomial greatest common divisors iteratively.
The squarefree part (i.e., product of all distinct monic irreducible
factors) of a nonconstant monic polynomial 
in a field of field
characteristic zero is 
,
where 
is the derivative of 
.
