Arithmétique modulaire — solved exercise (Undergraduate)
Statement
Find the inverse of 7 modulo 26 (answer in {0, …, 25}).
Strategy
Use the modular inverse condition and verify by multiplication modulo 26.
Step-by-step solution
1. Candidate inverse
A computation via the extended Euclidean algorithm gives $x=15$.
📖 Since $\gcd(7,26)=1$, the inverse of $7$ modulo $26$ exists and is unique modulo $26$.
2. Verification
$7\cdot 15=105$, and $105=4\cdot 26+1$, hence $105\equiv 1\pmod{26}$.
📖 This matches the definition of a modular inverse.
Result
The inverse of $7$ modulo $26$ is $\boxed{15}$.
Question-by-question check (two independent resolutions)
| 1 | 15 | ✔ |
Key concepts
modular inversecongruenceextended Euclidean algorithm
Tip
To find inverses modulo $n$, use the extended Euclidean algorithm and check that the gcd is $1$.
Have a similar exercise? Get it solved step by step, for free.
🧮 Solve my exercise