Proofs using the binomial theorem

AI Thread Summary
The discussion focuses on proving that the sum of the binomial coefficients multiplied by (-1) raised to the power of j equals zero, specifically ∑nj=0(-1)j(nCj)=0. The proof utilizes the binomial theorem by setting a=1 and b=-1, leading to the equation (1+(-1))^n=0. This simplifies to the left-hand side being equal to the sum of the binomial coefficients, confirming the statement. The original poster questions whether this method is the most effective or if mathematical induction would be a better approach. The conversation highlights the validity of the binomial theorem in proving the identity.
Keen94
Messages
41
Reaction score
1

Homework Statement


Prove that nj=0(-1)j(nCj)=0

Homework Equations


Definition of binomial theorem.

The Attempt at a Solution


If n∈ℕ and 0≤ j < n then 0=nj=0(-1)j(nCj)
We know that if a,b∈ℝ and n∈ℕ then (a+b)n=∑nj=0(nCj)(an-jbj)

Let a=1 and b= -1 so that 0=(1+(-1))n=∑nj=0(nCj)(1n-j(-1)j)

LHS=∑nj=0(nCj)(1)(-1)j) since (1n-j)=+1

LHS=∑nj=0(-1)j(nCj)

Is this the best way to prove it or is the induction business better? Thanks in advance!
 
Physics news on Phys.org
that's how I would have done it
 
Back
Top