Creation of the concept of zero point method in teaching mathematics

Authors

  • Tomáš Lengyelfalusy Department of Didactics Technology and Educational Technologies DTI University Sládkovičova 533/20, 018 41 Dubnica nad Váhom
  • Dalibor Gonda Faculty of Humanities University of Žilina Univerzitná 8215/1 010 26 Žilina

DOI:

https://doi.org/10.23755/rm.v36i1.466

Keywords:

concept creation, method of zero point, algorithm, pupils understanding

Abstract

Pupils learn different calculating algorithms. The effective use of learned algorithms requires creativity in their application to solve diverse tasks. To achieve this goal, it is necessary to create a concept of the calculating algorithm for pupils. The present paper describes a method of creating a zero point method. Teaching of this method is divided into two stages. In the first stage, the student masters the basic algorithm and becomes familiar with the main ideas of this method, while in the second stage a student learns how to apply this method with some modifications in other types of tasks. In our article we present the application of zero point method in solving quadratic inequalities.

References

Bušek, I. Řešené maturitní úlohy z matematiky. Praha: SPN. 1985.

Šedivý, O., Ďuriš, V., Fulier, J. Konštruktivizmus vo vyučovaní matematiky. In. Veda-vzdelávanie-prax - 2 diel: zborník z medzinárodnej vedeckej konferencie. Nitra, UKF 2007, p. 319-323, ISBN 978-80-8094-203-8.

Fulier, J., Šedivý, O. Motivácia a tvorivosť vo vyučovaní matematiky. Nitra: Fakulta prírodných vied UKF v Nitre. 2001.

Hejný, M. Teória vyučovania matematiky 2. Bratislava: SPN. 1991.

Odvárko, O. Metody řešení matematických úloh. Praha: SPN. 1990.

Turek, I. Didaktika. Bratislava: Iura Edition. 2008.

Hošková-Mayerová, Š., Rosická, Z. Programmed learning. In: Procedia - Social and Behavioral Sciences, Vol. 31, p. 782-787, 2012 DOI: 10.1016/j.sbspro.2011.12.141.

Ďuriš, V.: Prečo začleňovať počítačové programy do vyučovania. In. Technológia vzdelávania: vedecko-pedagogický časopis, ISSN 1335-003X, Vol. 6, 2005

Downloads

Published

2019-06-30

Issue

Section

Volume 36-2019