Strong Math Induction

Definition

Let $P$ be some predicate. If $P (1)$ is true and:
- $P (1) \land P (2) \land \dots \land P (k) ⟹ P (k + 1)$
If this is true, then $P (n)$ is true for all $n \in N$ .

Strong Math Induction and Regular Math Induction are equivalent. There is no major difference. Strong Math Induction and regular Math Induction are just different methods to achieve the same effect.
They're both still induction.