Show that the number:
$$7^n-\binom71\cdot 6^n+\binom72\cdot5^n-\binom73\cdot4^n+\binom74\cdot3^n-\binom75\cdot2^n+\binom76$$
is divisible by $7!$ for every $n\in \mathbb{N}$
Tried to do it by induction but the binomial coefficient confuses me
Thanks in advance!
Here is an alternate approach to induction, based upon the coefficient of operator $[z^k]$. It used to denote the coefficient of $z^k$ in a series. This way we can write e.g. \begin{align*} [z^j](1+z)^k=\binom{k}{j}\qquad\qquad\text{or}\qquad\qquad k![z^k]e^{jz}=j^k \end{align*}
Comment:
In (1) we use the summation symbol to write the expression more compactly.
In (2) we change the order of summation by replacing $j \rightarrow 7-j$.
In (3) we apply the coefficient of operator twice and extend the upper limit of the sum to $\infty$ without changing anything since we are adding zeros only.
In (4) we do some rearrangements as preparation for the next step.
In (5) we apply the substitution rule of the coefficient of operator with $z:=-e^u$ \begin{align*} A(u)=\sum_{k=0}^\infty a_k u^k=\sum_{k=0}^\infty u^k [z^k]A(z) \end{align*}
In (6) we do a small rearrangement and observe we obtain an exponential generating function of ${n\brace k}$, the Stirling numbers of the second kind.