BETAmodules.com is in beta — open to partnerships & joint ventures.Build with us
modules.com
⌘K

modular_inverse

v1.0.0RubyGems· Ruby

Given two integers ‘a’ and ‘m’, find modular multiplicative inverse of ‘a’ under modulo ‘m’. The modular multiplicative inverse is an integer ‘x’ such that. a x ≡ 1 (mod m) and x belongs to [0,1,2, .. m-1]

The verdict
Abandoned. Last published 9 years ago. No recent activity — look for a maintained alternative.
No recent activity — look for a maintained alternative.
Live from the RubyGems registry · derived rules, not AI
How it scores
MaintenanceAbandoned
PopularityNiche
SecurityClean
LicensePermissive
DepsZero deps
Maintenance
Last published 9 years ago.
Popularity
6 downloads / week
Security
No known advisories for this version (OSV).
License
MIT
Dependencies
No runtime dependencies
Recent releases
  • 1.0.09 years ago
modular_inverse — Given two integers ‘a’ and ‘m’, find modular multiplicative inverse of ‘a’ under modulo ‘m’. The modular multiplicative inverse is an integer ‘x’ such that. a x ≡ 1 (mod m) and x belongs to [0,1,2, .. m-1] (Ruby / RubyGems) · Modules