Search

Search Results

• On the psychology of mathematical problem solving by gifted students

  289-301

  Sandor M. Veres

  Views:

  33

  This paper examines the nature of mathematical problem solving from a psychological viewpoint as a sequence of mental steps. The scope is limited to solution processes for well defined problems, for instance, which occur at International Mathematical Olympiads. First the meta-mathematical background is outlined in order to present problem solving as a well defined search problem and hence as a discovery process. Solving problems is described as a sequence of elementary steps of the so called "relationship-vision" introduced here. Finally, non-procedural aspects of the psychology of problem solving are summarized, such as the role of persistence, teacher-pupil relationship, the amount of experience needed, self-confidence and inspiration at competitions.

• On an international training of mathematically talented students: assets of the 20 years of the “Nagy Károly Mathematical Student-meetings”

  77-89

  Sándor Kántor

  Tünde Kántor

  Views:

  33

  The focus of this paper is to present the gems of the "Nagy Károly Mathematical Student-meetings" in Rév-Komárom (Slovakia) from 1991 to 2010. During these 20 years there was done a lot of work to train mathematically talented students with Hungarian mother tongue and to develop their mathematical thinking, and to teach them problem solving and heuristic strategies for successful acting on the competitions. We collected the most interesting problems and methods presented by the trainer teachers.

• The Frobenius exchange problem on competitions and in classroom

  203-218

  Géza Kiss

  Views:

  10

  Let a_1, ..., a_n be relatively prime positive integers. The still unsolved Frobenius problem asks for the largest integer which cannot be represented as Σ x_i a_i with non-negative integers xi, and also for the number of non-representable positive integers. These and several related questions have been investigated by many prominent mathematicians, including Paul Erdős, and a wide range of partial results were obtained by various interesting methods differing both in character and difficulty. In this paper we give a self-contained introduction to this field through problems and comments suitable also for treatment in a class of talented students.

• Applications of methods of descriptive geometry in solving ordinary geometric problems

  103-115

  József Szabó

  Ildikó Molnár

  Views:

  30

  The importance of descriptive geometry is well-known in two fields. Spatial objects can be mapped bijectively onto a plane and then we can make constructions concerning the spatial objects. The other significance of descriptive geometry is that mathematical visual perception of objects in three-dimensional space can be improved by the aid of it. The topic of this paper is an unusual application of descriptive geometry. We may come across many geometric problems in mathematical competitions, in entrance examinations and in exercise books whose solution is expected in a classical way, however, the solution can be found more easily and many times more general than it is by the standard manner. We demonstrate some of these problems to encourage to use this geometric method. Understanding the solution requires very little knowledge of descriptive geometry, however, finding a solution needs to have some idea of descriptive geometry.

• Solving Diophantine equations with binomial coefficients in study group sessions using both elementary and higher mathematical methods

  1-12

  Richárd Rakamazi

  Views:

  28

  The paper can be considered as the continuation of [4] in the sense that we are studying Diophantine equations containing binomial coefficients. It was an important aspect that one should be able to discuss these problems — even if not in complete depth — also in high school study group sessions with the most talented students. We present various methods through several examples, which help the successful handling of other questions too, including problems in math competitions. Our discussion starts with the elementary treatment of easier problems, and then proceed gradually to more difficult questions which require higher mathematical methods.

• A proposal for an IOI Syllabus

  193-216

  Tom Verhoeff

  Gyula Horváth

  Krzysztof Diks

  Gordon Cormack

  Views:

  55

  The International Olympiad in Informatics (IOI) is the premier competition in computing science for secondary education. The competition problems are algorithmic in nature, but the IOI Regulations do not clearly define the scope of the competition. The international olympiads in physics, chemistry, and biology do have an official syllabus, whereas the International Mathematical Olympiad has made the deliberate decision not to have an official syllabus. We argue that the benefits of having an official IOI Syllabus outweigh the disadvantages. Guided by a set of general principles we present a proposal for an IOI Syllabus, divided into four main areas: mathematics, computing science, software engineering, and computer literacy.

• Combinatorics – competition – Excel

  427-435

  László Zsakó

  Views:

  31

  In 2001 the Informatics Points Competition of the Mathematics Journal for Secondary School Students (KÖMAL) was restarted [1]. The editors set themselves an aim to make the formerly mere programming competition a bit more varied. Therefore, every month there has been published a spreadsheet problem, a part of which was related to combinatorics. This article is intended to discuss the above mentioned problems and the solutions given to them at competitions. We will prove that traditional mathematical and programming tasks can be solved with a system developed for application purposes when applying a different way of thinking.