On Mar 28, 4:18 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On 3/28/07, Michel <[EMAIL PROTECTED]> wrote:
>
> > 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
On 3/28/07, Michel <[EMAIL PROTECTED]> wrote:
> 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
> presumabl
