I think it is solved with double counting. I tried to write unfolded, but I failed to solve the exercise. Can you help me?
Asked
Active
Viewed 103 times
0
Randy Marsh
- 2,857
Sam85
- 9
-
Hint: Let $\omega = e^{i\frac{2\pi}{3}}$, we have $1 + \omega^k + \omega^{2k} = \begin{cases}3, & k \equiv 0 \pmod 3\0, &k \not\equiv 0\pmod 3\end{cases}$, now apply binomial theorem to $(1+1)^n + (1+\omega)^n + (1+\omega^2)^n$, what do you get? – achille hui Oct 14 '20 at 20:31
-
See 1 or 2 or 3. – Jyrki Lahtonen Oct 14 '20 at 20:33
-
An interesting approach is to use induction. – Maths Wizzard Oct 14 '20 at 23:24