/sci/ - Science & Math

>>11512441
Can anyone give me a hint on this proof? I am trying to prove that the sum of all the terms of the nth row of Pascal’s triangle is equal to [math]2^{n}[/math]. I wrote a proof using the binomial theorem and considering 2 as [math](1+1)^{n}[/math], but I get the feeling that there is probably a good way to prove it using induction and I wanted to practice that, but I am not able to figure it out.