What is principle of mathematical induction? Explain with the help of an example.

Principle of Mathematical Induction (PMI)Let p(n) be a predicate involving a natural number n. Suppose the following two conditions hold:

  1. p(m) is true for some m ∈ N;
  2. If p(k) is true, then p(k+1) is true, where k(≥m) is any natural number. Then p(n) is true for every n ≥ m.

    Looking at the two conditions in the principle, can you make out why it works? (As a hint, put m = 1 in our example above.)

 

You may also like...

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.

error: Content is protected !!