discriminant,
gcd,
resultant,
xgcd
Further documentation:
) |
sage: x = PolynomialRing(GF(19)).gen() sage: f = x**3 + 3*x - 17 sage: f.discriminant() 12
right) |
Return the GCD of self and other, as a monic polynomial.
other) |
Returns the resultant of self and other, which must lie in the same polynomial ring.
INPUT: other -- a polynomial OUTPUT: an element of the base ring of the polynomial ring
sage: x = PolynomialRing(GF(19)).gen() sage: f = x**3 + x + 1; g = x**3 - x - 1 sage: f.resultant(g) 11
right) |
Return r,s,t such that r = s*self + t*right.
Instances of class Polynomial_dense_mod_p also have the following special methods:
__reduce__
See About this document... for information on suggesting changes.