GCD & LCMeasy
0:00.0

Using Bézout's identity, find an integer xx such that 7x1(mod5)7x \equiv 1 \pmod{5}.