A primitive $n$-th root of unity is an
$\omega \in \Bbb C \tag 1$
such that
$\omega^n = 1, \tag 2$
but
$\omega^k \ne 1, \; 1 \le k < n; \tag 3$
if
$\exists 1 \le j \ne l \le n, \; \omega^j = \omega^l, \tag 4$
we may without loss of generality assume
$j < l; \tag 5$
then from (4),
$\omega^{l - j} = 1; \tag 6$
but
$0 < l - j < n, \tag 7$
in contradiction to (3); thus (4) is false and the $\omega^k$, $1 \le k \le n$, are all distinct.
We note that each $\omega^k$, $1 \le k \le n$, is an $n$-th root of unity, since
$(\omega^k)^n = \omega^{kn} = \omega^{nk} = (\omega^n)^k = 1^k = 1. \tag 8$
In accord with (2) and (8), we see that each $\omega^k$ is a root of
$x^n - 1 \in \Bbb Q[x] \subsetneq \Bbb C[x]; \tag 9$
now since
$\deg (x^n - 1) = n, \tag{10}$
this polynomial has at most $n$ distinct roots; so since
$\vert \{\omega^1 = \omega, \omega^2, \ldots, \omega^{n - 1}, \omega^n = 1\} \vert = n, \tag{11}$
every $n$-th root of unity is in this set; there are no others.