I have repeatedly read on this list that sage has now optimized routines for linear algebra mod p. Does this extend to linear algebra mod m with m not prime?
I am mainly thinking about solving a system of linear equations (with presumably a unique solution). I know that one can reduce this problem to the prime case (if one knows the factorization of m) but I wonder if this now already built in. Michel --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
