If the multiplicative inverse of “53 modulo 21” exists, then which of the following is true?
If the multiplicative inverse of “53 modulo 21” exists, then which of the following is true? Correct Answer GCD(53,21) = 1
The multiplicative inverse of “a modulo m” can be found out by extended Euler’s GCD algorithm, and the time complexity of this method is O(logm). We know that the multiplicative inverse of “x modulo n” exists if and only if x and n are relatively prime (i.e., if gcd(a, m) = 1). So, in this case GCD(53,21) = 1.
মোঃ আরিফুল ইসলাম
Feb 20, 2025