Question

state second principal of finite induction.​

Answer 1

Answer:

The Second Principle of Mathematical Induction, described in class, comes to our rescue. For every n ≥ b, if P0,P1,...,Pn are all true, then Pn+1 is true. Note: This condition is often written as: For every n ≥ b, if Pk is true for all k : 0 ≤ k ≤ n, then Pn+1 is true.

Answer 2

Answer:

In other words, in the second principle, you get to assume more in the inductive step. ... In fact, both principles are equivalent for the positive integers. That is, if you can do a proof using ordinary induction, then you can translate that into a proof using the second induction principle in a fairly mechanical manner.