SOLUTION: prove that (n 0) + (n 1) + (n 2) + ... + (n k) = 2^n is true using mathematical induction.
note that (n k) is a falling factorial, and that n is a positive integer.
Algebra ->
Sequences-and-series
-> SOLUTION: prove that (n 0) + (n 1) + (n 2) + ... + (n k) = 2^n is true using mathematical induction.
note that (n k) is a falling factorial, and that n is a positive integer.
Log On
Question 1158365: prove that (n 0) + (n 1) + (n 2) + ... + (n k) = 2^n is true using mathematical induction.
note that (n k) is a falling factorial, and that n is a positive integer. Answer by Shin123(626) (Show Source):
