mathematical induction

Click a letter for the index

Or search the encyclopaedia:

 

 

Go

 

Formal method of proof in which the proposition P(n + 1) is proved true on the hypothesis that the proposition P(n) is true. The proposition is then shown to be true for a particular value of n, say k, and therefore by induction the proposition must be true for n = k + 1, k + 2, k + 3, ... . In many cases k = 1, so then the proposition is true for all positive integers.

Black and white reflect the black and white communities and the harmony between them. Yellow represents the golden beaches. Blue stands for the sea. Effective date: 22 February 1979. >>