Counting permutations in the mathematics classroom.

• Tanja Van Hecke ^[1]
  1. [1] Faculty of Applied Engineering Sciences . Ghent. Belgium.
• Localización: Teaching mathematics and its applications, ISSN 0268-3679, Vol. 32, Nº. 3, 2013, págs. 158-163
• Idioma: inglés
• DOI: 10.1093/teamat/hrt011
• Texto completo no disponible (Saber más ...)
• Resumen

  • A permutation of a list does not necessarily move all elements of this list. However, it can be a requirement that no element is mapped onto itself. These fixless permutations where all n elements have changed place after the permutation, appear in practical definitions of problems. An appealing example can be found in the problem where one wants to determine who should buy Christmas presents for whom. This topic can be incorporated in the math class at different levels: introductory by experiments, intermediary by a programming exercise to determine a limit value or advanced by a mathematical analysis based on recurrence relations. This makes it attractive for varied use by the mathematics teacher.