primpart takes as argument a polynomial P given by a
symbolic expression or by the list of its coefficients.
primpart returns the primitive part of P,
that is P divided by the GCD
(greatest common divisor) of its coefficients.
Input:
^
2-3x+9)or:
Output:
^
2-x+3