Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1-8 |
| Number of pages | 8 |
| Journal | Acta Informatica |
| Volume | 13 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1980 |
Fingerprint Dive into the research topics of 'Some beautiful arguments using mathematical induction'. Together they form a unique fingerprint.
Cite this
Dijkstra, E. W. (1980). Some beautiful arguments using mathematical induction. Acta Informatica, 13(1), 1-8. https://doi.org/10.1007/BF00288531