Re: Modulus arithmetics
- To: mathgroup at smc.vnet.net
- Subject: [mg6587] Re: [mg6457] Modulus arithmetics
- From: Daniel Lichtblau <danl>
- Date: Fri, 4 Apr 1997 02:11:36 -0500 (EST)
- Sender: owner-wri-mathgroup at wolfram.com
Gianluca Gorni wrote: > > A mathematician colleague of mine needs to make > computations with integers modulus a prime number. > He told me that he gave a look at Mathematica, but > that he rejected it because it seemed to him that > Mma is very inefficient at that kind of calculations. > > According to him, the calculations are made with > full integers throughout, and reduced modulus p only in the > end, with a big waste of time and memory. > > I think he tried with version 2.2. > ... Some of the linear algebra routines that take Modulus as an option, for example LinearSolve, were inefficient in the way noted, in version 2.x. These are working as they should in version 3. Other routines, e.g. Det, were also healthy in earlier versions. If your colleague had in mind functionality other than linear algebra, send some examples and I can perhaps say a bit more. Daniel Lichtblau Wolfram Research danl at wolfram.com