How to use this tool
- Enter integer a, modulus m.
- Select Calculate to view the result.
- Check the method and assumptions below before using the result.
Input reference and sample values
Use the units and choices shown for each field. Sample values are provided for practice, not as recommendations.
| Input | Format and units | Sample |
|---|---|---|
| Integer a | Enter text using the format shown in the sample. | 7 |
| Modulus m | Enter text using the format shown in the sample. | 26 |
Result for these sample inputs
15
- Greatest common divisor
- 1
Select Try the example in the form to load these values and calculate them again. This replaces the current form inputs. Compare the result with the method and worked explanation below.
The method, explained
An inverse exists exactly when gcd(a,m)=1. The extended Euclidean algorithm finds a Bézout coefficient for a, which is normalized into the range 0 through m−1.
Using integer a = 7, modulus m = 26, the result is 15. Change these example inputs to match your task; use the method above to check each step.
What to keep in mind
Integer inputs up to 200 digits. This demonstrates number theory and is not a cryptographic security service. Finite-precision arithmetic is used. Check the domain and the stated convention before using an approximation.
Common questions
Why can an inverse fail to exist?
When a and m share a factor greater than one, every multiple of a retains that factor modulo m and cannot be congruent to one.
How can I check the result?
An inverse exists exactly when gcd(a,m)=1. The extended Euclidean algorithm finds a Bézout coefficient for a, which is normalized into the range 0 through m−1. The worked example uses editable inputs. Calculations run on your device; no external API or account is required.
Methodology maintained by ClarityKit. How these tools are built and checked.