• anonymous
is any one good at doing proofs by induction?
  • Stacey Warren - Expert
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
  • jamiebookeater
I got my questions answered at in under 10 minutes. Go to now for free help!
  • anonymous
example: for all numbers n = 0,1,2,...., the sum 0+1+...+n is given by \[\frac{n(n+1)}{2}\] First we do the base case, which means to verify that the statement is true for n = 0. Indeed, if we plug in n = 0, we get that 0 = 0(1)/2 = 0. Next we have the induction step, where we assume that the statement is true for n, and prove it for n+1: Assume that \[0+1+...+n =\frac{n(n+1)}{2}\] Then by adding n+1 at the end we get: \[0+1+...+n+(n+1) = \frac{n(n+1)}{2}+(n+1) \] which when simplified gives \[\frac{(n+1)(n+2)}{2}\] and we've shown that the statement hold for n+1. Now, the base case has shown that n = 0 satisfies the statement, and the inductive step shows that since n = 0 holds, so does n = 1, and thus n = 2, etc... we've showed "by induction" that it holds for every n.

Looking for something else?

Not the answer you are looking for? Search for more explanations.