We want to find a number y such that \(23y \equiv 1 (\bmod 35)\). We can use the Extended Euclidean Algorithm to find the modular inverse.
Applying the Extended Euclidean Algorithm, we get:
35 = 1(23) + 12
23 = 1(12) + 11
12 = 1(11) + 1
Now, we can work our
Show more…