Let $a, m ∈ Z$ with $m ≥ 2.$ Suppose that $\gcd(a, m) > 1.$ I need to show there does not exist any integer $b$ such that $ab \equiv 1 \pmod m.$
Solving linear congruence (modular inverse or fraction) via gcd Bezout equation