- Joined
- Jul 10, 2007
- Messages
- 6,306
I'd like to use it for division, but I can't find any site on it that I can understand. Can anyone explain it to me?
Tx.
Also, Montgomery's is just for modulos right? Actually, Montgomery's algorithm would be useful too because I am going to run into the same problem I'm running into for the division method when I start on the mod method ; |.
So if anyone could help or link me to a good site, that'd be awesome : D.
I need to be able to get the quotient + remainder for the division.
I need to be able to get the remainder for the mod.
If I'm looking at the wrong algorithms, please let me know : ).
Ty all again.
edit
It looks like I want to use Montgomery's for both division and mod?
edit
It looks like Montgomery's is used for multiplication and mod as well as Barrett's =P.
Looking up divide and conquer algorithms. Anyone know some good ones besides peasant etc? Need to be able to divide any number by any other number, power of 2 or not ; P.
Tx.
Also, Montgomery's is just for modulos right? Actually, Montgomery's algorithm would be useful too because I am going to run into the same problem I'm running into for the division method when I start on the mod method ; |.
So if anyone could help or link me to a good site, that'd be awesome : D.
I need to be able to get the quotient + remainder for the division.
I need to be able to get the remainder for the mod.
If I'm looking at the wrong algorithms, please let me know : ).
Ty all again.
edit
It looks like I want to use Montgomery's for both division and mod?
edit
It looks like Montgomery's is used for multiplication and mod as well as Barrett's =P.
Looking up divide and conquer algorithms. Anyone know some good ones besides peasant etc? Need to be able to divide any number by any other number, power of 2 or not ; P.
Last edited: