Search
Search Results
-
Simple Variations on The Tower of Hanoi: A Study of Recurrences and Proofs by Induction
131-158Views:94The Tower of Hanoi problem was formulated in 1883 by mathematician Edouard Lucas. For over a century, this problem has become familiar to many of us in disciplines such as computer programming, algorithms, and discrete mathematics. Several variations to Lucas' original problem exist today, and interestingly some remain unsolved and continue to ignite research questions. Nevertheless, simple variations can still lead to interesting recurrences, which in turn are associated with exemplary proofs by induction. We explore this richness of the Tower of Hanoi beyond its classical setting to compliment the study of recurrences and proofs by induction, and clarify their pitfalls. Both topics are essential components of any typical introduction to algorithms or discrete mathematics.
Subject Classification: A20, C30, D40, D50, E50, M10, N70, P20, Q30, R20
-
A constructive and metacognitive teaching path at university level on the Principle of Mathematical Induction: focus on the students' behaviours, productions and awareness
133-161Views:77We present the main results about a teaching/learning path for engineering university students devoted to the Principle of Mathematical Induction (PMI). The path, of constructive and metacognitive type, is aimed at fostering an aware and meaningful learning of PMI and it is based on providing students with a range of explorations and conjecturing activities, after which the formulation of the statement of the PMI is devolved to the students themselves, organized in working groups. A specific focus is put on the quantification in the statement of PMI to bring students to a deep understanding and a mature view of PMI as a convincing method of proof. The results show the effectiveness of the metacognitive reflections on each phase of the path for what concerns a) students' handling of structural complexity of the PMI, b) students' conceptualization of quantification as a key element for the reification of the proving process by PMI; c) students' perception of the PMI as a convincing method of proof.
Subject Classification: 97B40, 97C70
-
Correction to Mneimneh (2019): "Simple variations on the Tower of Hanoi: A study of recurrences and proofs by induction” Teaching Mathematics and Computer Science 17 (2019), 131-158.
109Views:67In the article “Simple variations on the Tower of Hanoi: A study of recurrences and proofs by induction” by Saad Mneimneh (Teaching Mathematics and Computer Science, 2019, 17(2), 131–158. https://doi.org/10.5485/TMCS.2019.0459), there was an error in Table 1 (p. 155), and consequently, the first paragraph of Section 8 (p. 154) also needed correction.