Tagged Questions
5
votes
1answer
265 views
Montgomery Modular Exponentiation
I'm trying to write a Montgomery exponentiation based on this which can compete with Mathematica PowerMod. We know that PowerMod ...
9
votes
1answer
152 views
Modular arithmetic - efficiently calculating the remainders of factorials
When working on this question regarding the divisibility of the sum of factorials, I decided to write some code to test "small values" of the problem using the following code.
...
1
vote
0answers
150 views
Faster GCD Implementation
Is there any chance to write a faster GCD than the built-in one in Mathematica?
@Mr.Wizard has written one in this question (although it's not for this purpose) which is 6 times slower on a 100k ...
