modular_inverse 1.0.0
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]
Gemfile:
=
安裝:
=
版本列表:
- 1.0.0 December 02, 2016 (9.0 KB)
Runtime 相依性套件 (1):
engtagger
>= 0
擁有者:
作者:
-
Utkarsh
SHA 256 總和檢查碼:
=