A very powerful method of proof for a statement involving integers is analogous to climbing a ladder. If we (1) can get on the first rung of the ladder and (2) if we can get from each rung to the next higher rung, then we claim that we can get to every rung of the ladder. This may seem like common sense. It is, and this common sense is codified as follows, where by a “proposition” we mean any statement that makes sense.
KeywordsPositive Integer Induction Hypothesis Induction Step Basis Step Strong Form
Unable to display preview. Download preview PDF.