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]

Required Ruby Version

>= 0

Authors

Utkarsh

Versions

  1. 1.0.0 December 02, 2016 (9 KB)

SHA 256 checksum