-
Notifications
You must be signed in to change notification settings - Fork 46
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Multiplication Algorithms #3
Comments
Surely Jason's code implements this via the operator overload starting in line 208 of uint128_t.cpp : By the way, you may be interested in the modified version of this operator overload that I wrote to solve a contest center puzzle, described in http://arthurvause.blogspot.co.uk/2017/05/three-pandigitals.html |
I do long multiplication in |
For modulo and divisions, have you tried Barrett? There’s also other method which combines Newton Inversion with Barrett’s algorithm (Newton Division), there’s an interesting paper here comparing algorithms: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.111.9736&rep=rep1&type=pdf |
Cool! Thanks! I'll get to it at some point. |
I made a ton of additions/changes in https://github.com/Kronuz/uint_t lots of optimizations and quite a few algorithms |
Nice! |
What multiplication algorithm are you using here for
uint128_t
anduint256_t
? I don’t see this algorithm in yourinteger
repository... why?The text was updated successfully, but these errors were encountered: