@propensive Hey there. Spire has support for BigInt, which (I think) has methods to do this. I know another user was interested...
@d6 I need to do some exponentiation of big integers modulo big primes. Can Spire do this efficiently? Any pointers to get me started?
-
-
-
@d6 Looks like there's a method called modPow on BigInt. Just what I need - thanks, Erik!
End of conversation
New conversation -
-
-
@propensive ... so I'll look into it and make sure it works OK.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.