Search

Search Results

• Two centuries of the equations of commutativity and associativity of exponentiation

  219-233

  Lajos Lóczi

  Views:

  61

  In this survey article we guide the reader through the solution of the commutative equation of exponentiation x^y = y^x and that of the associative equation of exponentiation x^(y^z) = (x^y)^z. Various characterizations of the integer, rational, real and complex solutions are discussed together with some new results and open directions. The article is supplemented by a detailed and commented bibliography on the history of these equations.

• Examining relation between talent and competence through an experiment among 11th grade students

  17-34

  Veronika Árendás

  Views:

  120

  The areas of competencies that are formable, that are to be formed and developed by teaching mathematics are well-usable in recognizing talent. We can examine the competencies of a student, we can examine the competencies required to solve a certain exercise, or what competencies an exercise improves.
  I studied two exercises of a test taken by students of the IT specialty segment of class 11.d of Jedlik Ányos High School, a class that I teach. These exercises were parts of the thematic unit of Combinatorics and Graph Theory. I analysed what competencies a gifted student has, and what competencies I need to improve while teaching mathematics. I summarized my experience about the solutions of the students, the ways I can take care of the gifted students, and what to do to the less gifted ones.

• Apollonius' problems in grammar school

  69-85

  Elvira Ripco Sipos

  Views:

  119

  In this work there are ten problems of Apollonius listed with illustrations and solution possibilities including students' solutions, too. Usually, it is rather difficult for students to grasp the essence of these problems with the use of traditional means, bows and rulers, but the use of computers offers higher accuracy.

• Teaching puzzle-based learning: development of transferable skills

  245-268

  Nickolas Falkner

  Raja Sooriamurthi

  Zbigniew Michalewicz

  Views:

  233

  While computer science and engineering students are trained to recognise familiar problems with known solutions, they may not be sufficiently prepared to address novel real-world problems. A successful computer science graduate does far more than just program and we must train our students to reach the required levels of analytical and computational thinking, rather than hoping that it will just 'develop'. As a step in this direction, we have created and experimented with a new first-year level course, Puzzle-based Learning (PBL), that is aimed at getting students to think about how to frame and solve unstructured problems. The pedagogical goal is increase students' mathematical awareness and general problem solving skills by employing puzzles, which are educational, engaging, and thought provoking. In this paper we continue sharing our experiences in teaching such a course. Whereas a brief discussion on our pedagogical objectives were covered in the first paper together with the material of the first of two lectures on pattern recognition, this follow-up paper presents the material of the second of two lectures, in which additional exercises are discussed to reinforce the lesson. Along the way we provide a glimpse of some foundational ideas of computer science such as incomputability and general system development strategies such as incremental and iterative reasoning. This paper discusses the outcomes of PBL courses, which include expected improvement in the overall results achieved by students who have undertaken PBL courses, compared to those students who have not.

• Supporting the theory of math didactic using knowledge-measuring questions and analysis of the solutions

  1-16

  Sándor Kántor

  Péter Fejes-Tóth

  Views:

  137

  New or rediscovered results presented in this paper are the results of the analysis of the problem sets used in the two-tier system secondary school final examination in mathematics, a system that was introduced in Hungary in 2005.
  Many of the revealed problem arise in connection with misunderstanding the text of the problems. Causes of misinterpretation can be either that the text is lacking some important information, or that it should be interpreted not in word-to-word manner.
  Theses and their argumentations presented here refer partly on the new types of problems (tests, non-standard mathematical contents), and partly on improvement of learning-teaching process in topics of equations and approximations.

• Teaching puzzle-based learning: development of basic concepts

  183-204

  Nickolas Falkner

  Raja Sooriamurthi

  Zbigniew Michalewicz

  Views:

  301

  While computer science and engineering students are trained to recognise familiar problems with known solutions, they may not be sufficiently prepared to address novel real-world problems. A successful computer science graduate does far more than just program and we must train our students to reach the required levels of analytical and computational thinking, rather than hoping that it will just 'develop'. As a step in this direction, we have created and experimented with a new first-year level course, Puzzle-based Learning (PBL), that is aimed at getting students to think about how to frame and solve unstructured problems. The pedagogical goal is increase students' mathematical awareness and general problem solving skills by employing puzzles, which are educational, engaging, and thought provoking. We share our experiences in teaching such a course – apart from a brief discussion on our pedagogical objectives, we concentrate on discussing the presented material which covers (in two lectures) just one selected topic (pattern recognition). In this paper we present the ideas behind foundations for PBL and the material of the first of two lectures on pattern recognition, in which we address core concepts and provide students with sufficient exemplars to illustrate the main points.