Loading...
Finds the modular inverse, crucial for cryptographic and number-theoretical applications.
Extended Euclidean Algorithm
Step-by-step Solution
Result Verification
Coprime Detection
Cryptography Ready
Visual Feedback
Input the number (a) for which you want to find the inverse.
Input the modulus (m) - must be a positive integer.
Choose to show calculation steps and enable result verification.
Click 'Calculate Inverse' to find the modular multiplicative inverse.
Check the verification showing (a × inverse) mod m = 1.