Alternating sum over bottom of binomial coefficient with top fixed equals 0

Theorem

The following formula holds: $$\displaystyle\sum_{k=0}^n (-1)^k {n \choose k} = {n \choose 0} - {n \choose 1} + {n\choose 2} - \ldots \pm {n \choose n}=0,$$ where the sign $\pm$ depends on whether $n$ is even or odd and ${n \choose k}$ denotes the binomial coefficient.

References

• 1964: {{ #if: |{{{2}}}|Milton Abramowitz}}{{#if: Irene A. Stegun|{{#if: |, {{ #if: |{{{2}}}|Irene A. Stegun}}{{#if: |, [[Mathematician:{{{author3}}}|{{ #if: |{{{2}}}|{{{author3}}}}}]]{{#if: |, [[Mathematician:{{{author4}}}|{{ #if: |{{{2}}}|{{{author4}}}}}]]{{#if: |, [[Mathematician:{{{author5}}}|{{ #if: |{{{2}}}|{{{author5}}}}}]] and [[Mathematician:{{{author6}}}|{{ #if: |{{{2}}}|{{{author6}}}}}]]| and [[Mathematician:{{{author5}}}|{{ #if: |{{{2}}}|{{{author5}}}}}]]}}| and [[Mathematician:{{{author4}}}|{{ #if: |{{{2}}}|{{{author4}}}}}]]}}| and [[Mathematician:{{{author3}}}|{{ #if: |{{{2}}}|{{{author3}}}}}]]}}| and {{ #if: |{{{2}}}|Irene A. Stegun}}}}|}}: [[Book:Milton Abramowitz/Handbook of mathematical functions{{#if: |/Volume {{{volume}}}|}}{{#if: |/{{{edpage}}}}}|Handbook of mathematical functions{{#if: |: Volume {{{volume}}}|}}{{#if: |: {{{eddisplay}}}|{{#if: | ({{{ed}}} ed.)}}}}]]{{#if: | (translated by [[Mathematician:{{{translated}}}|{{ #if: |{{{2}}}|{{{translated}}}}}]])}}{{#if: |, {{{publisher}}}|}}{{#if: |, ISBN {{{isbn}}}|}}{{#if: Sum over bottom of binomial coefficient with top fixed equals 2^n | ... (previous)|}}{{#if: Finite sum of arithmetic progression | ... (next)|}}{{#if: |: Entry: {{#if: |[[{{{entryref}}}|{{{entry}}}]]|{{{entry}}}}}|}}: 3.1.7