I found the following Math Stack Exchange article, which proves this statement for N = 2015 but the subset of elements should be divisible by 5 and I am trying to understand the first answer of the following article.
There are two things I don´t understand about it.
I don´t get why the last equality in the equation (*) holds. I get that the scalar before $x^{|S|}$ is equal to 1 if $\sum S = 0 \text{ mod } 5 $. But I don´t understand what happens to the scalars w.r.t to subsets, which are not divisible by 5.
I don´t understand how $$ f(\omega^j,x) = (1+x^5)^{403} \text{ for } j = 1,2,3,4 $$ can be derived. I am looking for a calculation proving that.
In general I am aware, that there is an article, proving my question for prime numbers, but I am particularly interested, in the case where n is not necessarily prime.
Unfortunately my reputation is too low to comment the original post :/