")dis op gcdPolynomial" returns (SUP D, SUP D) -> SUP D
for D has GCDDOM and D has PFECAT, but
"PFECAT has GCDDOM", so the signature is duplicated.
In catdef.spad, no need to export gcdPolynomial for PFECAT
again.
diff --git a/src/algebra/catdef.spad b/src/algebra/catdef.spad
index 0358e04..ffa2b88 100644
--- a/src/algebra/catdef.spad
+++ b/src/algebra/catdef.spad
@@ -1268,11 +1268,6 @@ PolynomialFactorizationExplicit() : Category ==
Definition where
++ univariate polynomial p into irreducibles
++ where p is known to be square free
++ and primitive with respect to its main variable.
- gcdPolynomial : (P, P) -> P
- ++ gcdPolynomial(p, q) returns the gcd of the univariate
- ++ polynomials p qnd q.
- -- defaults to Euclidean, but should be implemented via
- -- modular or p-adic methods.
solveLinearPolynomialEquation : (List P, P) -> Union(List P,"failed")
++ solveLinearPolynomialEquation([f1, ..., fn], g)
++ (where the fi are relatively prime to each other)
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
