Intereting Posts

Isomorphism between tensor product and quotient module.
What's the point of eta-conversion in lambda calculus?
Is the set of closed points of a $k$-scheme of finite type dense?
Show that the $\mathbb{Z}$-span $\mathbb{Z}b'_1+\cdots+ \mathbb{Z}b'_d$ of $B^+$ does not depend on the choice of $B$
If $ABCD$ is a cyclic quadrilateral, then $AC\cdot(AB\cdot BC+CD\cdot DA)=BD\cdot (DA\cdot AB+BC\cdot CD)$
Finding specific ideals of a ring
How do I calculate the intersection(s) of a straight line and a circle?
How many parameters are required to specify a linear subspace?
Explain Zermelo–Fraenkel set theory in layman terms
What is $\, _4F_3\left(1,1,1,\frac{3}{2};\frac{5}{2},\frac{5}{2},\frac{5}{2};1\right)$?
Proof that the equation $x^2 – 3y^2 = 1$ has infinite solutions for $x$ and $y$ being integers
Existence of $\sqrt{-1}$ in $5$-adics, show resulting sum is convergent.
Period of the sum/product of two functions
If $f$ is continuous, nonnegative on $$, show that $\int_{a}^{b} f(x) d(x) = 0$ iff $f(x) = 0$
Definite Dilogarithm integral $\int^1_0 \frac{\operatorname{Li}_2^2(x)}{x}\, dx $

Show that $$\sum_{k=0}^{n} (-1)^{k} \binom{n}{k} = 0$$

So for odd $n$ we have an even number of terms. So $\binom{n}{k} = \binom{n}{n-k}$ which have opposite signs. Thus the sum is $0$.

For even $n$ we have that $$\sum_{k=0}^{n} (-1)^{k} \binom{n}{k} = \binom{n}{0}+\sum_{k=1}^{n-1} (-1)^{k} \binom{n}{k} + \binom{n}{n}$$

- What is $\sum_{r=0}^n \frac{(-1)^r}{\binom{n}{r}}$?
- Prove that $2^n < \binom{2n}{n} < 2^{2n}$
- Evaluate a sum with binomial coefficients: $\sum_{k=0}^{n} (-1)^k k \binom{n}{k}^2$
- Asymptotics of sum of binomials
- Non-probabilistic proofs of a binomial coefficient identity from a probability question
- Asymptotic of a sum involving binomial coefficients

Now $$\sum_{k=1}^{n-1} (-1)^{k} \binom{n}{k} = \sum_{k=1}^{n-1} (-1)^{k} \left[\binom{n-1}{k} + \binom{n-1}{k-1} \right]$$

What would that sum be in the square brackets?

- Prove combinatorics identity
- Proving $\sum_{k=1}^{n}{(-1)^{k+1} {{n}\choose{k}}\frac{1}{k}=H_n}$
- Prove the following equality: $\sum_{k=0}^n\binom {n-k }{k} = F_n$
- Show that $ \sum_{r=1}^{n-1}\binom{n-2}{r-1}r^{r-1}(n-r)^{n-r-2}= n^{n-2} $
- Prove $\sum_{k=1}^{\infty} \frac{\sin(kx)}{k} $ converges
- Proving a special case of the binomial theorem: $\sum^{k}_{m=0}\binom{k}{m} = 2^k$
- How can I compute $\sum\limits_{k = 1}^n \frac{1} {k + 1}\binom{n}{k} $?
- Fibonacci identity proof
- How to solve second degree recurrence relation?
- Proving $k \binom{n}{k} = n \binom{n-1}{k-1}$

Here is an alternate way:

$$0=(1-1)^n=\sum_{k=0}^{n} (-1)^{k} \binom{n}{k}$$

by the binomial theorem.

Another way for combinatorially-minded people:

$$\sum_{k=0}^n (-1)^k \binom{n}{k} = 0$$

is the number of ways to flip n coins and get an even number of heads, minus the number of ways to flip n coins and get an odd number of heads. Since the parity of the number of heads will always come down to the last coin flipped, and heads/tails are of course equally likely at that point, the sum evaluates to 0.

You should know that

$$

(a+b)^n=\sum_{k=0}^n \binom nk a^kb^{n-k}.

$$

When $b=1$, this says

$$

(1+a)^n=\sum_{k=0}^n \binom nk a^k.

$$

So now you just need to consider the case where $a=-1$.

For odd $n$, the OP gave a **bijective** proof of the result. The following is a bijecive proof that works for all $n$.

Let $A=\{1,2,\dots, n\}$. Let $\mathcal{E}$ consist of the subsets of $A$ of even cardinality, and let $\mathcal{O}$ consist of the subsets of $A$ of odd cardinality. We produce an explicit bijection $\varphi: \mathcal{E} \to \mathcal{O}$.

If $S\in \mathcal{E}$ and $1\notin S$, let $\varphi(S)=S\cup\{1\}$.

If $S\in \mathcal{E}$ and $1\in S$, let $\varphi(S)=S\setminus\{1\}$.

**Comment:** For the sake of symmetry, it is probably better to define $\varphi(S)$ as above, but for *any* subset $S$ of $A$. Then $\varphi$ is an *involution* on $P(A)$ that interchanges sets of even cardinality with sets of odd cardinality.

$$0=(1-1)^n=\sum_k{n\choose k}(-1)^k$$

We have, since $n-1$ is odd

\begin{align*}\sum_{k=1}^{n-1}(-1)^k\left[\binom{n-1}k+\binom{n-1}{k-1}\right]&=\sum_{k=1}^{n-1}(-1)^k\binom{n-1}k-\sum_{j=0}^{n-2}(-1)^j\binom{n-1}j\\

&=-1+\binom{n-1}{n-1}(-1)^{n-1}\\

&=-2,

\end{align*}

hence $$\sum_{k=0}^n\binom nk(-1)^k=\binom n0 -2+\binom nn =0.$$

One can also give a topological proof of the binomial identity $\sum_{i=0} ^{n} (-1)^i \binom{n}{i}=0$. Consider the standard $(n-1)$-simplex $\Delta^{n-1}$. This has $\binom{n+1}{i+1}$ $i$-simplicies, hence the Euler characteristic of $\Delta^{n-1}$ is

$$\chi(\Delta^{n-1})=\sum_{i=0} ^{n-1} (-1)^i \binom{n}{i+1}.$$

The Euler characteristic is homotopy invariant and $\Delta^{n-1}\simeq *$, so we must have

$$\sum_{i=0} ^{n-1} (-1)^i \binom{n}{i+1}=1,$$

or

$$\sum_{i=0} ^{n-1} (-1)^i \binom{n}{i+1}-\binom{n}{0}=0$$

since $\binom{n}{0}=1$.

Multiplying both sides by $-1$ yields the identity

$$\sum_{i=0} ^{n} (-1)^i \binom{n}{i}=0.$$

Another approach:

For the difference operator $\Delta f (m) = f(m+1)-f(m)$, the $n$th iteration is

$$\Delta^n f(m)=\sum_{k}(-1)^{n-k}\binom nk f(m+k)$$

Clearly, your sum is the $n$th difference of the constant function $f\equiv 1$, so of course it is zero for $n\ge 1$ because already $f(m+1)-f(m) =0 $.

- How do I prove that any unit fraction can be represented as the sum of two other distinct unit fractions?
- $\lim_n \frac{1}{n} E(\max_{1\le j\le n} |X_j|) = 0$
- Moebius band not homeomorphic to Cylinder.
- Shortest proof for 'hairy ball' theorem
- Intuitive Understanding About the Implicit Function Theorem
- Any group of order four is either cyclic or isomorphic to $V$
- How do I prove that for every positive integer $n$, there exist $n$ consecutive positive integers, each of which is composite?
- A commutative ring $A$ is a field iff $A$ is a PID
- Why $\{ \emptyset \} $ is not a subset of $\{ \{\emptyset \} \} $
- Are polynomials of the form : $ f_n= x^n+x^{n-1}+\cdots+x^{k+1}+ax^k+ax^{k-1}+\cdots+a$ irreducible over $\mathbb{Z} $?
- Conjecture: the sequence of sums of all consecutive primes contains an infinite number of primes
- A question on mean value inequality
- $\lim_{{n}\to {\infty}}\frac{1^p+2^p+\cdots+n^p}{n^{p+1}}=?$
- Difference of random variables
- Showing that $10!=6!7!$ via Gamma function