Everyone knows that $\sum{n \choose 2k}=\sum{n \choose 2k+1}$
My question is follwing
What is the clear form of $\sum_{k=0} (-1)^k{n \choose 2k}$ and $\sum_{k=0} (-1)^k{n \choose 2k+1}$
For example, my exercise is
"calculate a+b where a=$\sum_{k=0}^{25} (-1)^k{50 \choose 2k}$ & b=$\sum_{k=0}^{24} (-1)^k{50 \choose 2k+1}$"
I found that it is relative to number 4.
If n has a form 4k+2 then a=0 and b=$(-1)^k2^{2k+1}$ or If n has a form 4k then b=0 and a=$(-1)^k2^{2k}$
But it's just my hypothesis.(I just wrote it when n=1,2,3,...,10 and found a rule)