Skip to main content

Mathematical induction

  • Chapter
  • First Online:
Exploring Mathematics

Part of the book series: Springer Undergraduate Mathematics Series ((SUMS))

  • 3875 Accesses

Abstract

Mathematical induction is one of the most important methods for proving statements of the form “For all natural numbers . . . ”. At its heart it is another instance of the idea of recursion: reduce the problem to a smaller problem of the same kind. Mathematical induction implements this idea for proofs, while recurrence relations are used in problems where you want to determine some quantity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Daniel Grieser .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Grieser, D. (2018). Mathematical induction. In: Exploring Mathematics. Springer Undergraduate Mathematics Series. Springer, Cham. https://doi.org/10.1007/978-3-319-90321-7_3

Download citation

Publish with us

Policies and ethics