document.write( "Question 1158365: prove that (n 0) + (n 1) + (n 2) + ... + (n k) = 2^n is true using mathematical induction.\r
\n" ); document.write( "\n" ); document.write( "note that (n k) is a falling factorial, and that n is a positive integer.
\n" ); document.write( "

Algebra.Com's Answer #781374 by Shin123(626)\"\" \"About 
You can put this solution on YOUR website!
Duplicate. I solved it here. \n" ); document.write( "
\n" );