In mod n arithmetic why does x have a multiplicative inverse

In mod n arithmetic, why does x have a multiplicative inverse if and only if x is relatively prime to n?

Solution

Whenever x has multiplicative inverse when the greatest common divisor gcd(n,x) =1 which means there are common factors between x and n except 1 which implies by definition that x is relatively prime to n.