Search

Search Results

• Simple Variations on The Tower of Hanoi: A Study of Recurrences and Proofs by Induction

  131-158

  Saad Mneimneh

  Views:

  73

  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

• Some logical issues in discrete mathematics and algorithmic thinking

  243-258

  Viviane Durand-Guerrier

  Views:

  52

  The role of logic in mathematics education has been widely discussed from the seventies and eighties during the “modern maths period” till now, and remains still a rather controversial issue in the international community. Nevertheless, the relevance of discrete mathematics and algorithmic thinking for the development of heuristic and logical competences is both one of the main points of the program of Tamás Varga, and of some didactic teams in France. In this paper, we first present the semantic perspective in mathematics education and the role of logic in the Hungarian tradition. Then, we present insights on the role of research problems in the French tradition. Finely, we raise some didactical issues in algorithmic thinking at the interface of mathematics and computer science.

  Subject Classification: 97E30