Actions
Feature #11003
closedFast modular exponentiation
[ruby-core:<unknown>]
Description
I would like to suggest, implementing "fast Modular Exponentiation " (http://en.wikipedia.org/wiki/Modular_exponentiation) for fixnum class.
Eg: A function like pow(a, n, MOD) can be computed more efficiently than (a**n) % MOD
Updated by mrkn (Kenta Murata) over 9 years ago
- Status changed from Open to Feedback
- Assignee set to matz (Yukihiro Matsumoto)
I have two questions:
- Do you have some concrete use cases in which this new feature is used?
- Why don't you make a gem library to provide this feature? or Are there gem libraries providing it?
Updated by mrkn (Kenta Murata) about 7 years ago
- Is duplicate of Feature #12508: Integer#mod_pow added
Updated by mrkn (Kenta Murata) about 7 years ago
- Status changed from Feedback to Closed
The same function was accepted in #12508
Actions
Like0
Like0Like0Like0Like0