Strong induction allows the step for an integer to use the result for every smaller integer.

Backward induction

Backward induction proves or computes a finite sequence of statements by starting at its terminal index and stepping toward the initial index.

 Discussion (0)

There are no discussions about this article yet.

Mathematical induction is a fundamental proof technique used in mathematics to establish that a statement or proposition is true for all natural numbers (or a certain subset of them). It is particularly useful for proving statements that have a sequential or recursive nature.