Mathematical induction is a complete induction. This is a strict mathematical proof. Its main idea has two steps: 1 and proving that the proposition is correct when n= 1. 2. Assuming that the proposition is correct when n=k, it is deduced that the proposition is correct when n=k+ 1 In this way, the proposition is correct for all natural numbers. 1 can be pushed to 2, 2 can be pushed to 3, and so on.

Incomplete induction can only prove that the proposition is correct when n takes some of these numbers, but it cannot prove that it is correct for all natural numbers.