$$S(n,k,m) \stackrel{\text {def}}{=} \sum_{r=0}^{\left\lfloor\frac {n-k}{m}\right\rfloor}\binom{n}{k+rm}$$
Find the difference between the greatest and smallest among $S(n,k,5)$ for $k=0,1,2,3,4$.
I observed that it's a Fibonacci sequence that follows. The n$^\text {th}$difference is basically the n-1$^\text {th}$ Fibo term. But that's an observation after plotting some values and then the rigor comes from using induction.
But I observed that it can be done using the fifth roots of unity as well (perhaps?). How to proceed with that?
Let $1,\omega, \omega^2, \omega^3, \omega^4$ be the roots, where $\omega^k=e^\frac {2k\pi i}{5}$. I can then filter out by putting the roots and multiplying $(1+x)^n$ with $1,x,x^2,x^3,x^4$ for each of $1,\omega^4, \cdots, \omega$ respectively. And thus we get $S(n,k,5)$ for each of the mentioned values of $k$. How to proceed?