ModularDistinctDegreeFactorizer UΒΆ
moddfact.spad line 1 [edit on github]
This package supports factorization and gcds of univariate polynomials over the integers modulo different primes. The inputs are given as polynomials over the integers with the prime passed explicitly as an extra argument.
- ddFact: (U, Integer) -> List Record(factor: U, degree: Integer)
ddFact(f, p)
computes a distinct degree factorization of the polynomialf
modulo the primep
, i.e. such that each factor is a product of irreducibles of the same degrees. The input polynomialf
is assumed to be square-free modulop
.
- gcd: (U, U, Integer) -> U
gcd(f1, f2, p)
computes thegcd
of the univariate polynomialsf1
andf2
modulo the integer primep
.