Summary
Three elegant proofs and an efficient algorithm are derived. The derivations evolve smoothly from the choice to apply mathematical induction, the pattern of reasoning that has been chosen as the ‘Leitmotiv’ for this small collection. The last proof is the by-product of the algorithm.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dijkstra, E.W. Some beautiful arguments using mathematical induction. Acta Informatica 13, 1–8 (1980). https://doi.org/10.1007/BF00288531
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288531