anonymous
  • anonymous
principle of mathematical induction
Mathematics
katieb
  • katieb
See more answers at brainly.com
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.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this
and thousands of other questions

anonymous
  • anonymous
just one thing wanna ask why we take n=1
anonymous
  • anonymous
and n=k+1
Mertsj
  • Mertsj
The simplest and most common form of mathematical induction proves that a statement involving a natural number n holds for all values of n. The proof consists of two steps: The basis (base case): showing that the statement holds when n is equal to the lowest value that n is given in the question. Usually, n = 0 or n = 1. The inductive step: showing that, with respect to each n for which the statement holds, then the statement must also hold when n + 1 is substituted for n.

Looking for something else?

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

More answers

anonymous
  • anonymous
but we can't take n=0
Mertsj
  • Mertsj
So you show it is true for one value. Then show it is true for 1 more than that value. That shows it is true for all.
Mertsj
  • Mertsj
Not if you're using natural numbers only. Then you might want to take n = 1
anonymous
  • anonymous
k
Mertsj
  • Mertsj
Notice it says take the lowest value that n (k if you prefer) is given in the question.
Mertsj
  • Mertsj
Show it is true for k. Then the inductive step...show it is true for k+1
Mertsj
  • Mertsj
http://www.youtube.com/watch?v=QHkG0d5kZvE
Mertsj
  • Mertsj
Maybe that video will help.
anonymous
  • anonymous
k
DLS
  • DLS
@msingh You should be polite while conversing with other people on OS and try to make some efforts for giving a proper reply followed by a thanks if a user helped you. It hardly takes your time to write "Okay" rather than k. Just an advice :]
DLS
  • DLS
Because I see @Mertsj is making a great effort to help you.
anonymous
  • anonymous
okay..i will keep in mind
anonymous
  • anonymous
@Mertsj thank u sis
Mertsj
  • Mertsj
I know you are thankful, msingh. You always say so and you are most welcome.
Mertsj
  • Mertsj
I only hope that was helpful.
anonymous
  • anonymous
yes,,it was helpful for me

Looking for something else?

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