Advertisement

Mathematical Induction

  • George E. Martin
Part of the Undergraduate Texts in Mathematics book series (UTM)

Abstract

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.

Keywords

Positive Integer Induction Hypothesis Induction Step Basis Step Strong Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • George E. Martin
    • 1
  1. 1.Department of Mathematics and StatisticsState University of New York at AlbanyAlbanyUSA

Personalised recommendations