- Thread starter
- #1
If you theoretically could line up a row that is infinitely long, then you know that any domino will push the next one over, as long as the first domino is pushed. Mathematical induction works the same way. You need to prove a statement for a base case (which is equivalent to pushing the first domino), and then you need an inductive step, which is to prove that IF the statement is true for an arbitrary case, THEN the statement will be true for the next (which is equivalent to any domino pushing the next one over).Verify that
1(1!)+2(2!)+...+n(n!) = (n+1)! - 1
is true using induction
This problem has me stumped...
With simple steps You can verify that is...Verify that
1(1!)+2(2!)+...+n(n!) = (n+1)! - 1
is true using induction
This problem has me stumped...
I am still not sure that you understand how induction works and what has to be proved (not how it is proved). There is no separate nth and (n+1)th cases in a proof by induction.The nth case I understand. It is the n+1th case that has me stumped.