SqFreeFactor: small (or big) bug?
This example gives error (others seem to work fine)
Fp ::= ZZ/(32003); Use Fpt ::= Fp[t]; factor(t^3+t-5); --> irreducible K := Fpt/ideal(t^3+t-5); K; Use K[x]; F := x^2 +(t^2)*x +(-1); SqFreeFactor(F); --> ERROR: Unable to convert value --> SqFreeFactor(F); --> ^^^^^^^^^^^^^^^
#1 Updated by John Abbott over 1 year ago
- Status changed from New to Resolved
- Assignee set to John Abbott
- % Done changed from 0 to 80
- Estimated time set to 0.33 h
I have modified
SparsePolyRingBase::myGCD to handle specially only if coeffs are
IsRingFp; previously it just tested for small positive characteristic (without checking that it is a prime field).
Checked in; should be OK now.