modular exponentiation?
|
06-28-2018, 09:40 PM
Post: #28
|
|||
|
|||
RE: modular exponentiation?
(06-28-2018 06:07 PM)ijabbott Wrote: I wonder why POWMOD is so slow? Does it do POW followed by MOD? No, it works in the usual way but it is more primitive than the Prime's version, thus requiring the check for negative values. Also integer comparisons are very slow for some reason. About 20 seconds of that run time is taken by the < function. Additionally, the prime is almost 100 * as fast as the HP 50 which accounts for most of the difference. |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)