Okay, I looked into the issue. In the top version from Singular of the
repository now has a not yet fully tested polynomial arithmetic for Z/
n with the following functions:
1) +, -, * of polynomials and numbers
2) where possible / and inverses of numbers (polynomials by monomials
just a matter of a few adaptions)
(div by zero divisors is allowed, as long as possible)
3) gcd, lcm of numbers (in Z/n)
Uses the same API as arithmetic for polynomials over fields. If
somebody has access to the repository version, you need to compile
Singular with
#define HAVE_RING2TOM
#define HAVE_RINGMODN
in mod2.h. You can use the new coefficients with:
ring r = (modnat, 200), x, dp;
==> Z/200[x]
or
ring r = (modpow, 2, 13), x, dp;
==> Z/2^13[x]
... Oliver
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~----------~----~----~----~------~----~------~--~---
