Studying mathematical induction and recursive programming together
Keith Brandt, Margaret F. Richey
Abstract
Keith Brandt, Margaret F. Richey
Abstract
Mathematical induction is a proof technique used throughout math-ematics, and recursion is a programming concept frequently used in computer science. This note will explore the parallel between induction proofs and recursive programs by providing several example problems that lead to an induction proof and a corresponding recursive program. We feel that students who are exposed to this parallel will gain a deeper understanding of both topics.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Mathematical induction is a proof technique used throughout math-ematics, and recursion is a programming concept frequently used in computer science. This note will explore the parallel between induction proofs and recursive programs by providing several example problems that lead to an induction proof and a corresponding recursive program. We feel that students who are exposed to this parallel will gain a deeper understanding of both topics.
Key concepts: Recursion (computer science), Mathematical induction, Mathematical proof, Computer science, Mutual recursion, Theoretical computer science, Programming language, Calculus (dental)