Szerző szerinti böngészés "Mneimneh, Saad"

Megjelenítve 1 - 2 (Összesen 2)
  • Nincs kép
    TételSzabadon hozzáférhető
    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.
    (2023-09-28) Mneimneh, Saad
    In 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.
  • Nincs kép
    TételSzabadon hozzáférhető
    Simple Variations on The Tower of Hanoi: A Study of Recurrences and Proofs by Induction
    (2020-03-24) Mneimneh, Saad
    The 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