GCD & LCMhard
0:00.0

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