It can be represented as: ax ≡ ≡ 1 (mod m). The multiplicative inverse of “a modulo m” exists if and only if a and m are relatively prime, i.e. gcd(a, m) = 1.
確定！ 回上一頁
