MathGroup Archive 1997

[Date Index] [Thread Index] [Author Index]

Search the Archive

Modulus arithmetics

  • To: mathgroup at
  • Subject: [mg6457] Modulus arithmetics
  • From: Gianluca Gorni <gorni at>
  • Date: Fri, 21 Mar 1997 23:00:07 -0500 (EST)
  • Sender: owner-wri-mathgroup at

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.

I am a long-time Mma user, but I have never used
Modulus myself. Can anyone confirm with me if
my colleague is right on this one?

Thanks in advance.

Gianluca Gorni


Gianluca Gorni
Universita` di Udine
Dipartimento di Matematica e Informatica
via delle Scienze 208
I-33100 Udine UD

Ph.:(39) (432) 558422    Fax:(39) (432) 558499
mailto:gorni at

  • Prev by Date: Re: Problem with collect
  • Next by Date: Re: 3D Plots
  • Previous by thread: Re: Console IO from mathlink
  • Next by thread: Reading data from web pages