When it does, the product of the integer and its multiplicative inverse is congruent to 1 modulo n. Page 3. Steps used in Extend Euclidian Algorithm : 1. If gcd ...
確定! 回上一頁