# Mathematical induction

 related topics {math, number, function} {theory, work, human} {day, year, event} {@card@, make, design} {car, race, vehicle} {water, park, boat}

Mathematical induction is a method of mathematical proof typically used to establish that a given statement is true of all natural numbers (non-negative integers). It is done by proving that the first statement in the infinite sequence of statements is true, and then proving that if any one statement in the infinite sequence of statements is true, then so is the next one.

The method can be extended to prove statements about more general well-founded structures, such as trees; this generalization, known as structural induction, is used in mathematical logic and computer science. Mathematical induction in this extended sense is closely related to recursion.

Mathematical induction should not be misconstrued as a form of inductive reasoning, which is considered non-rigorous in mathematics (see Problem of induction for more information). In fact, mathematical induction is a form of rigorous deductive reasoning.

## Contents

### History

In 370 BC, Plato's Parmenides may have contained an early example of an implicit inductive proof.[1] The earliest implicit traces of mathematical induction can be found in Euclid's [2] proof that the number of primes is infinite and in Bhaskara's "cyclic method".[3] An opposite iterated technique, counting down rather than up, is found in the Sorites paradox, where one argued that if 1,000,000 grains of sand formed a heap, and removing one grain from a heap left it a heap, then a single grain of sand (or even no grains) forms a heap.