- #1
Punkyc7
- 420
- 0
use the binomial expansion formula to find the alternating sum of the numbers in row n of Pascals triangle.
nC0-nC1+nC2...
So I wrote a few rows of the triangle and it looks like once you get past row zero the alternating sum of the numbers in the rows all add to zero.
Does that work for an answer for this problem or does there have to be some type of proof... if it has to be a proof would you have to use induction?
nC0-nC1+nC2...
So I wrote a few rows of the triangle and it looks like once you get past row zero the alternating sum of the numbers in the rows all add to zero.
Does that work for an answer for this problem or does there have to be some type of proof... if it has to be a proof would you have to use induction?