This is a question related to Fermat's last theorem. Let $p\geq5$ be a prime number, and let $\zeta$ be a primitive $p$th root of unity. Consider the Fermat's last theorem: \begin{equation} z^p = (x+y)(x+y\zeta)\cdots(x+y\zeta^{p-1}) \end{equation} where $(x,y,z)$ are pairwise coprime in $\mathbb{Z}$. How to prove that the terms on the right-hand side are coprime in $\mathbb{Z}[\zeta]$. Does this only apply to the "first case" of the theorem(i.e. $p\nmid xyz$)?
Some background: if we have this conclusion and together if we assume that $\mathbb{Z}[\zeta]$ is a UFD, this would be a starting point to prove the theorem. But the assumption $\mathbb{Z}[\zeta]$ is a UFD is not true in general. More detailed discussions can be found in section 1.5 of chapter 1 of Matthew Baker's lecture note http://people.math.gatech.edu/~mbaker/pdf/ANTBook.pdf