Feature #1580
New fn prim for polys
Status:
Closed
Priority:
Normal
Assignee:
Category:
New Function
Target version:
Description
Implement a new function prim
.
Over QQ
is should make the coeffs integer and coprime:
/**/ f := 2*x+4/7; /**/ prim(f); 7*x+2
Not sure what it should do if the coeff ring is not QQ
.
Perhaps just "error" in the first impl.
Related issues
History
#1 Updated by John Abbott about 3 years ago
- Status changed from New to In Progress
- Assignee set to John Abbott
- % Done changed from 0 to 50
I now a have prototype impl which works for "towers" of poly rings (even a mix of sparse multivariate and dense univariate)
#2 Updated by John Abbott about 3 years ago
- Status changed from In Progress to Feedback
- % Done changed from 50 to 90
- Estimated time set to 3.33 h
I have now integrated prim
into the code (will check in shortly).
Also added documentation (both CoCoALib and CoCoA).
No tests... should I?
#3 Updated by John Abbott about 3 years ago
- Related to Feature #1582: Factorization in K(a,b)[x,y] added
#4 Updated by John Abbott about 3 years ago
It might be helpful to generalize the fn so that it works in rings such as QQ(a,b)[c,d](e,f)[x,y]
.
#5 Updated by John Abbott over 2 years ago
Try to implement the idea in comment 4 (above).
#6 Updated by John Abbott about 2 years ago
- Related to Feature #1668: Generalize prim added
#7 Updated by John Abbott about 2 years ago
- Status changed from Feedback to Closed
- % Done changed from 90 to 100
Closing this issue. Created new issue for the generalization: #1668