Search

Search Results

• Error analysis in teaching combinatorics: the development of prospective teachers’ confidence and problem-solving skills

  103-125

  Zoltán Paulovics

  Csaba Csapodi

  Zoltán Lóránt Nagy

  Views:

  0

  This study investigates the pedagogical potential of error analysis in the teaching of combinatorics within mathematics teacher education. Building on previous research that highlights the role of incorrectly worked sample solutions in cognitive, metacognitive, and affective learning processes, we conducted a mixed-methods study with prospective mathematics teachers at Eötvös Loránd University. Quantitative results from Likert-scale questionnaires (n = 26) indicate that regular analysis of incorrectly worked solutions substantially enhanced participants’ self-confidence, strengthened their problem-solving skills, and positively shaped their attitudes toward future teaching practice. Complementary qualitative data, analyzed through grounded theory, revealed five interrelated categories – self-reflection and confidence, discernment, deeper understanding, methodological surplus, and combinatorial surplus – that together explain the mechanisms through which error analysis supports professional growth. The findings suggest that systematic analysis of conceptual errors not only improves problem-solving competence but also fosters self-confidence, self-reflection, and teaching-related attitudes. By comparing our emergent model of error-analysis thinking with Schoenfeld’s problem-solving framework, we argue that “discernment” constitutes a distinctive and central dimension of error-based learning. The study contributes both theoretically, by refining models of mathematical problem solving, and practically, by offering concrete recommendations for integrating error analysis into mathematics teacher education curricula.

  Subject Classification: 97C30, 97K20, 97D40, 97C70, 97C99

• Teaching sorting in ICT

  101-117

  Péter Szlávi

  Gábor Törley

  Views:

  215

  This article is aimed at considering how an algorithmic problem – more precisely a sorting problem – can be used in an informatics class in primary and secondary education to make students mobilize the largest possible amount of their intellectual skills in the problem solving process. We will be outlining a method which essentially forces students to utilize their mathematical knowledge besides algorithmization in order to provide an efficient solution. What is more, they are expected to use efficiently a tool that has so far not been associated with creative thinking. Sorting is meant to be just an example, through which our thoughts can easily be demonstrated, but – of course the method of education outlined can be linked to several other algorithmic problems, as well.

• Learning and teaching combinatorics with Sage

  389-398

  István Vajda

  Views:

  206

  Learning Mathematics is not an easy task, since this subject works with especially abstract concepts and sophisticated deductions. Many students lose their interest in the subject due to lack of success. Computer algebra systems (CAS) provide new ways of learning and teaching Mathematics. Numerous teachers use them to demonstrate concepts, deductions and algorithms and to make learning process more interesting especially in higher education. It is an even more efficient way to improve the learning process, if students can use the system themselves, which helps them to practice the curriculum.
  Sage is a free, open-source math software system that supports research and teaching algebra, analysis, geometry, number theory, cryptography, numerical computation, and related areas. I have been using it for several years to aid the instruction of Discrete Mathematics at Óbuda University. In this article I show some examples how representations provided by this system can help in teaching combinatorics.