I find this exercise in the book Linear Algebra, a modern introduction by David Poole, fourth edition, it was the last one of the exercise section 1.1 about vectors (kind of odd because of the topic, in my opinion).
Now, I have the answer, but I was wondering if there is some easier —or vector (?)— way to do it, because I use a theorem —not presented in the book— that I'm not able to prove by myself. Here my "proof":
$ax = 1$ in $Z_{m}$
if and only if a multiple of $a$ is exactly one unit more than a multiple of $m$, that is there exist integers $k$ and $q$ such that
$ak = mq + 1$
$ak - mq = 1$
But thanks to the Bézout's identity —the theorem I mentioned early— we know that the integers of the form $az + mt$ are exactly the multiples of the greatest common divisor (g.c.d.) of $a$ and $m$. That means $k$ and $q$ exist if and only if the g.c.d of $a$, $m$ is 1, that is, $a$ and $m$ are coprime integers.
What do you think about this argument? Do you know a more "elementary" proof? Please share your opinion.