Well, I don't know whether it is exactly correct.I get this result when I was dealing with a simple problem "find out the factors of $x^{10}+x^5+1$". I put different $n$ into this polynomial and draw the roots in the complex plane by WolframAlpha: n=4,7,9
The distribution of these roots has certain rules: the red angle is half of the blue one, and one red angle comes after one blue angle and make up the whole circle in this way. By observing the pictures, we can easily get the result that is stated in the question.
The following question has been moved to another post:How to prove that $\sum_{i=0}^kx^{in}$ have a same factor $P(x)$ if and only if $n \not\equiv 0 \bmod (k+1)$?
[ Also, for $x^{3n}+x^{2n}+x^n+1$, I infer it has a factor $x^2+1$ if and only if $n\not \equiv 0\bmod 4$. Also see the pictures: n=2,3,4,5
My guess is: For polynomials $x^{kn}+x^{(k-1)n}+…+x^{2n}+x^n+1,k\geq2$, if $n\not \equiv 0\bmod (k+1)$, they all have a certain factor $P(x)$.
Is that true?How do I find the factor $P(x)$?How to prove?(I think the method of Cotes' Theorem may be used for it. See T. Needham, Visual Complex Analysis, pp 46-47) ]
Since $(x^2+x+1)(x-1)=x^3-1$ the roots of $(x^2+x+1)$ are $\{\zeta,\zeta^2\}$ where $\zeta$ is a primitive cubic root of $1$.
When $n\not\equiv 0\bmod 3$ there is an equality of sets $\{\zeta^n,\zeta^{2n}\}=\{\zeta,\zeta^2\}$ which shows that $\zeta$ and $\zeta^2$ are also roots of $x^{2n}+x^n+1$, thus the divisibility of polynomials.
On the other hand when $n\equiv0\bmod3$ we have $\zeta^n=\zeta^{2n}=1$ so $\{\zeta,\zeta^2\}$ are not roots of $x^{2n}+x^n+1$.