I have problem with the following sum for $n \ge k \ge 0$: $$\sum_{i=0}^k (-1)^i i \binom{n}{i} \binom{n}{k-i}$$
I've tried to use $i\binom{n}{i} = n\binom{n-1}{i-1}$ which give me the form $$n\sum_{i=1}^k (-1)^i \binom{n-1}{n-i} \binom{n}{k-i}$$
and here I stuck.
We start with OPs second form omitting the factor $n$. It is convenient to use the coefficient of operator $[z^k]$ to denote the coefficient of $z^k$ in a series. This way we can write e.g. \begin{align*} [z^k](1+z)^n=\binom{n}{k}\tag{1} \end{align*}
Comment:
In (2) we shift the index $i$ to start with $i=0$ and use the binomial identity $\binom{p}{q}=\binom{p}{p-q}$.
In (3) we apply the coefficient of operator twice. We also extend the upper range of the series to $\infty$ without changing anything since we are adding zeros only.
In (4) we do some rearrangements and use the linearity of the coefficient of operator and apply the rule $[z^{p-q}]A(z)=[z^p]z^qA(z)$.
In (5) we use the substitution rule of the coefficient of operator with $u=-z$ \begin{align*} A(z)=\sum_{i=0}^\infty a_iz^i=\sum_{i=0}^\infty z^k[u^i]A(u) \end{align*}
In (6) we use the linearity of the coefficient of operator again to swallow a factor $(1+z)$.
In (7) we select the coefficient of $[z^{k-2}]$ resp. $[z^{k-1}]$ according to even and odd $k$.