Re: [PrimeNumbers] Calculating high powers mod integer
- If your technique is "modular remainder", it is known.
--- Mar 8/9/09, Yann Guidon <whygee@...> ha scritto:
Da: Yann Guidon <whygee@...>
Oggetto: Re: [PrimeNumbers] Calculating high powers mod integer
Data: Martedì 8 settembre 2009, 07:58
Kermit Rose wrote:
>I thought that it was a known technique ?
> I wrote a short test program to illustrate that it is much faster to
> take the modulus during the calculation of the high power
> than it is to first calculate the high power, and then take the modulus.
[Non-text portions of this message have been removed]