module QQX: sig .. end
Univariate polynomials with rational coefficients
include Polynomial.Univariate
val pp : Format.formatter -> t -> unit
val show : t -> string
val summation : t -> t
Given a polynomial p(x), compute a polynomial q(x) such that that
for every integer x >= 0, we have q(x) = sum_{i=0}^x p(i).
val factor : t -> QQ.t * (t * int) list
Given a polynomial p(x), compute a factorization p(x) = c*q1(x)^d1 *
... qn(x)^dn such that each qi is an irreducible polynomial with
integer coefficients.