GCD & LCMhard
0:00.0

For which value of aa does the modular congruence ax1(mod143)ax \equiv 1 \pmod{143} have an integer solution?

(Hint: 143=11×13143 = 11 \times 13)