Prove that $\frac{3}{5} + \frac{4}{5}i$ is not a root of unity I want to prove that $z=\frac{3}{5} + \frac{4}{5}i$ is not a root of unity, although its absolute value is 1.
When transformed to the geometric representation: $$z=\cos{\left(\arctan{\frac{4}{3}}\right)} + i\sin{\left(\arctan{\frac{4}{3}}\right)}$$ According to De Moivre's theorem, we get:
$$z^n= \cos{\left(n\arctan{\frac{4}{3}}\right)} + i\sin{\left(n\arctan{\frac{4}{3}}\right)}$$
Now, if for $n\in \mathbb{N}: z^n=1$, then the imaginary part of the expression above must be zero, therefore:
$$\sin{\left(n\arctan{\frac{4}{3}}\right)}=0 \iff n\arctan{\frac{4}{3}} = k\pi, \ \ \ k \in \mathbb{N}$$
And we get that for $z$ to be a root of unity for some natural number $n$, $n$ must be in the form:
$$n = \frac{k\pi}{\arctan{\frac{4}{3}}}, \ \ \ k \in \mathbb{N}$$
On the other hand, for $z^n=1$ it must be that:
$$\cos{\left(n\arctan{\frac{4}{3}}\right)} = 1 \iff n\arctan{\frac{4}{3}} = 2l\pi, \ \ \ l \in \mathbb{N}$$
and thus
$$n = \frac{2l\pi}{\arctan{\frac{4}{3}}}, \ \ \ l \in \mathbb{N}$$
By comparing those two forms of $n$, it must be the case that $k=2l$ and for $n$ to satisfy $z^n = 1$. What follows is that $n$ should be in the form 
$$n = \frac{2l\pi}{\arctan{\frac{4}{3}}}, \ \ \ l \in \mathbb{N}$$
But, at the same time, $n$ must be a natural number. Should I prove now that such $n$ cannot even be a rational number, let alone a natural one? Or how should I approach finishing this proof?

Here's a simple proof using only divisibility in Gaussian integers $\,\Bbb G = \Bbb Z[i] = \{ j\! +\! k\, i\, :\, j,k\in\Bbb Z\}.\,$
Here $\ b\mid a\ $ means $\,b\,$ divides $\,a\,$ in $\Bbb G,\,$ i.e.  $\, bx=a\,$ for some $\,x\in \Bbb G,\,$ and $\,\overline{j\!+\!k\,i} = j\! -\! k\, i\,$ 
Let $\,p = 2\!-\!i\,$ and $\,a = \dfrac{3\!+\!4i}5 = \dfrac{\bar p\bar p}{p\bar p} = \dfrac{\bar p}p\,.\ $ Then $\ a^n = 1\,\Rightarrow\, p^n = \bar p^n\Rightarrow\,p\mid \bar p^n\,$ by $\,n>0.$
But $\ p\mid \color{#c00}{\bar px}\,\Rightarrow\, p\mid x.\ $ Proof $\,\  p\mid(p\!+\!\color{#c00}{\bar p})\color{#c00}x = 4x,\,\ p\mid p{\bar px} = 5x,\,\\ $ so $\,\ p\mid 5x\!-\!4x= x$
So $\ \ p\mid \bar p \bar p^{n-1}\Rightarrow\, p\mid \bar p^{n-1}\cdots\Rightarrow\, p\mid \bar p\cdot 1\,\Rightarrow\, p\mid 1,\,$ contra $\,\dfrac{1}p = \dfrac{\bar p}{\bar p p} = \dfrac{2\!+\!i}5 \not\in \Bbb G =\Bbb Z[i]$
Remark $\ $ More generally. RRT = Rational Root Test extends the above to show that $a$ is not the root of any monic polynomial $\in \Bbb G[x].\,$ In fact - just as for $\Bbb Z\,$ - RRT holds for all fractions over $\,\Bbb G\,$ because it enjoys a Euclidean division algorithm, so gcds exist, so the RRT proof still works.
