Re: Mersenne: Head's algorithm for multiplying mod n

[Jud McCranie]

At 06:19 AM 7/8/99 -0400, you wrote:
>All,
>In the book _Primes and Programming_ Head's method of multiplying
>two numbers mod n is mentioned.  Is this actually more effiecient
>than simply multiplying the two numbers and taking the modulus?
>
Yes, because it keeps the numbers smaller.  It was originally: Method from
Multiplication Modulo N, by A. K. Head, Bit 20 (1980) 115-116 



+----------------------------------------------+
| Jud "program first and think later" McCranie |
+----------------------------------------------+


________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm