Doubt Primitive root n

Question

$m$ is said to be primitive root of $n$ if we are able to get all remainder from $0$ to $n-1$ when $m^k$ ($k = 1 \dots n-1$) is divided by $n$. Is it correct ??

Is $n$ necessarily has to be a prime number or it holds always true?