Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

principle of mathematical induction

Mathematics
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

just one thing wanna ask why we take n=1
and n=k+1
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.

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

but we can't take n=0
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.
Not if you're using natural numbers only. Then you might want to take n = 1
k
Notice it says take the lowest value that n (k if you prefer) is given in the question.
Show it is true for k. Then the inductive step...show it is true for k+1
http://www.youtube.com/watch?v=QHkG0d5kZvE
Maybe that video will help.
k
  • 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
Because I see @Mertsj is making a great effort to help you.
okay..i will keep in mind
@Mertsj thank u sis
I know you are thankful, msingh. You always say so and you are most welcome.
I only hope that was helpful.
yes,,it was helpful for me

Not the answer you are looking for?

Search for more explanations.

Ask your own question