Let $p(x) = (x + 1)^m - x^m - 1$ and $q(x) = (x^2+x+1)^2$. Coefficients if these polynomials are in $\mathbb{R}$
So, the question is: "For which $m$ p(x) can be divided by $q(x)$ without remainder?".
I tried to use this idea: let's simulate GCD's algorithm for $p(x)$ and $q(x)$ and see for which $m$ their gcd is dividable to $q(x)$, but didn't got any intresting results.
So, maybe exists a better solution. I'll be very grateful.