Guest Session: 1 Question Remaining. Create Account to save progress.
Login
GCD & LCMhard
0:00.0

To find the multiplicative inverse of 111111 modulo 262626, we solve 11x≡1(mod26)11x \equiv 1 \pmod{26}11x≡1(mod26), or equivalently 11x+26y=111x + 26y = 111x+26y=1 using the Extended Euclidean Algorithm. Find xxx in the range [0,25][0, 25][0,25].