Mathematical Induction

  • Daniel W. Cunningham


Proof by mathematical induction is a special method of proof that is often used to establish that certain statements are true for every natural number. We shall first discuss the well-ordering principle and a proof strategy that is used to prove that every natural number n>1 is divisible by a prime number. An explicit proof strategy is presented that will be used in proofs by mathematical induction. After reviewing the basic properties of sequences and summation notation, we carefully show the reader how to correctly use the induction proof strategy. The final sections focus on recursive definitions and proof by strong induction. The chapter ends with a proof of the fundamental theorem of arithmetic.


  1. 1.
    Barwise, J., Etchemendy, J.: The Language of First-Order Logic. CSLI Lecture Notes, vol. 23, 3rd edn. Stanford University Center for the Study of Language and Information, Stanford (1993). Including the program Tarski’s WorldGoogle Scholar
  2. 2.
    Bourbaki, N.: Elements of Mathematics. Algebra, Part I: Chapters 1–3. Hermann, Paris (1974). Translated from the FrenchGoogle Scholar
  3. 3.
    Courant, R., Robbins, H.: What Is Mathematics? Oxford University Press, New York (1941)Google Scholar
  4. 4.
    Dunham, W.: Journey Through Genius. Penguin Books, New York (1991)Google Scholar
  5. 5.
    Enderton, H.B.: Elements of Set Theory. Academic (Harcourt), New York (1977)Google Scholar
  6. 6.
    Enderton, H.B.: A Mathematical Introduction to Logic, 2nd edn. Harcourt/Academic, Burlington (2001)Google Scholar
  7. 7.
    Epp, S.: Discrete Mathematics with Applications. Thompson, Belmont (2004)Google Scholar
  8. 8.
    Halmos, P.R.: Naive Set Theory. Springer, New York (1974). Reprint of the 1960 edition, Undergraduate Texts in MathematicsGoogle Scholar
  9. 9.
    Hawking, S.W.: A Brief History of Time. Bantam Books, Toronto/New York (1988)Google Scholar
  10. 10.
    Herstein, I.N.: Abstract Algebra, 3rd edn. Prentice Hall, Upper Saddle River (1996)Google Scholar
  11. 11.
    Rudin, W.: Principles of Mathematical Analysis. International Series in Pure and Applied Mathematics, 3rd edn. McGraw-Hill, New York (1976)Google Scholar
  12. 12.
    Velleman, D.J.: How to Prove It. Cambridge University Press, Cambridge, UK (1994)Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Daniel W. Cunningham
    • 1
  1. 1.Mathematics DepartmentBuffalo State CollegeBuffaloUSA

Personalised recommendations