How do I prove $2 \binom n2 + 4 \binom n4 + 6 \binom n6 + \cdots = n 2^{n-2}$
I thought about using known $\sum k\binom nk = n2^{n-1} $ and then just dividing it by 2. But is it possible you can help me with writing the full solution, because for the first known theorem you need to derivate $(a+b)^n $and also $a=1, b=x$. But for this one it won't work. maybe I can just prove that known theorem I presented, prove it, and then just divide it by 2. because the known theorem is $1 \binom n2 + 2 \binom n4 + 3 \binom n6 + \cdots$ (co efficients are divided by two than the presented question)
Edit: I posted a solution.
\begin{align*} (1+x)^n & = \sum_{k=0}^n \binom{n}{k}x^k\\ \frac{d}{dx}(1+x)^n & = \sum_{k=1}^n k\binom{n}{k}x^{k-1}\\ n(1+x)^{n-1} & = \sum_{k=1}^n k\binom{n}{k}x^{k-1} \end{align*} Likewise \begin{align*} n(1-x)^{n-1} & = \sum_{k=1}^n (-1)^kk\binom{n}{k}x^{k-1} \end{align*} Now add $$n(1+x)^{n-1} +n(1-x)^{n-1} =2\sum_{\stackrel{k=1}{k \text{ even}}}^nk\binom{n}{k}x^{k-1}$$ and evaluate at $x=1$.