Find modular inverse of a (mod b).
Number to find modular inverse of.
Modulus.
Ensure that a * modInv(a, b) = 1 (mod b). If strict = false we have a * modInv(a, b) = gdc(a, b) (mod b) instead.
strict = false
The modular inverse in the range {0, 1, ..., b - 1}.
Find modular inverse of a (mod b).