If m is a primitive root mod n, prove that { }

runs through all numbers nod n that are relatively prime to n.

I assume it has something to do with numbers relatively prime to n

and the fact that it's a prim root it runs through all the numbers but not sure how to succinctly prove it.