Create modularMultiplicativeInverse.py

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) 
The value of x should be in {0, 1, 2, … m-1}, i.e., in the range of integer modulo m.

Author: goflora

Python/modularMultiplicativeInverse.py

@@ -0,0 +1,18 @@
+# Python 3 program to find modular  
+# inverse of a under modulo m 
+  
+# A naive method to find modulor  
+# multiplicative inverse of 'a'  
+# under modulo 'm' 
+def modInverse(a, m) : 
+    a = a % m; 
+    for x in range(1, m) : 
+        if ((a * x) % m == 1) : 
+            return x 
+    return 1
+  
+# Driver Program 
+a = 3
+m = 11
+print(modInverse(a, m)) 
+