Introduction

Two Ways of Reasoning

Mathematics rests on two complementary styles of reasoning: deduction and induction.

Deductive reasoning starts from general statements already accepted as true and derives a particular conclusion from them. The classic example is a syllogism: if "all men are mortal" and "Socrates is a man," it follows necessarily that "Socrates is mortal." In numerical form: since every number divisible by $2$ is even, and $8$ is divisible by $2$, we may conclude $8$ is even. Deduction moves from the general rule to the particular instance — once the premises are accepted as true, the conclusion is forced.

Inductive reasoning, by contrast, moves in the opposite direction — from particular observed cases toward a general conjecture. In everyday scientific work we gather evidence case by case and, after enough consistent observations, propose a general law. This is the everyday meaning of "induction": generalising from what has been checked instance by instance.

Why Ordinary Induction Is Not Enough in Mathematics

In algebra, many results are framed in terms of a variable $n$ that ranges over the positive integers — a formula for a sum of $n$ terms, or a claim that some expression is always divisible by a fixed number. Simply checking such a statement for $n = 1, 2, 3, \ldots$ up to some large value can never establish that it holds for every natural number $n$, because the natural numbers never run out; there is always an untested value beyond wherever we stop. Mathematics therefore needs a tool that certifies a statement $P(n)$ for all natural numbers $n$ using only a finite argument.

---

That tool is the Principle of Mathematical Induction (PMI) — a precise, rigorous technique built for exactly this situation: a statement $P(n)$ indexed by a positive integer $n$ that we want to prove true for every value of $n$ at once, without testing each value one by one. The mechanism itself — a starting case and a rule that carries truth forward step by step — is built up in the next two sections.