Project

General

Profile

Bug #981

SqFreeFactor: small (or big) bug?

Added by Anna Maria Bigatti over 1 year ago. Updated 8 months ago.

Status:
Closed
Priority:
Normal
Assignee:
Category:
Incomplete function
Target version:
Start date:
25 Nov 2016
Due date:
% Done:

100%

Estimated time:
0.75 h
Spent time:

Description

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);
--> ^^^^^^^^^^^^^^^

History

#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.

#2 Updated by John Abbott over 1 year ago

  • Estimated time changed from 0.33 h to 0.75 h

Added Anna's example to CoCoA-5 tests/exbugs.cocoa5. Checked in.

#3 Updated by Anna Maria Bigatti over 1 year ago

Works on other examples (used in factorization over algebraic extensions).
Thanks! great!

#4 Updated by John Abbott 8 months ago

  • Status changed from Resolved to Closed
  • % Done changed from 80 to 100

Also available in: Atom PDF