Polynomial with unique factorization domain coefficients. In addition to the basic polynomial operations and pseudo division methods, it has gcd and content.
This class inherits DomainPolynomial, SubresultantGcdProvider and ContentProvider.
Initialize the polynomial.
Return content of the polynomial.
(This method is inherited from ContentProvider)
Return the primitive part of the polynomial.
(This method is inherited from ContentProvider)
Return the greatest common divisor of given polynomials. They
must be in the polynomial ring and its coefficient ring must
be a UFD.
(This method is inherited from SubresultantGcdProvider)
Reference: Algorithm 3.3.1 of Cohen
Return (A, B, P) s.t. A*self+B*other=P, where P is the greatest common divisor of given polynomials. They must be in the polynomial ring and its coefficient ring must be a UFD.
Reference: Kida's lecture note p.18
(This method is inherited from SubresultantGcdProvider)
(new in 0.90.0)
Return the resultant of self and other.
(This method is inherited from SubresultantGcdProvider)
(new in 0.90.0)