• Communications of Mathematical Education
• /
• v.38 no.1
• /
• pp.49-67
• /
• 2024

Recent interest in the diverse applications of artificial intelligence (AI) language models has highlighted the need to explore didactical uses in mathematics education. AI language models, capable of natural language processing, show promise in solving mathematical word problems. This study tested the capability of ChatGPT, an AI language model, to solve word problems from elementary school textbooks, and analyzed both the solutions and errors made. The results showed that the AI language model achieved an accuracy rate of 81.08%, with errors in problem comprehension, equation formulation, and calculation. Based on this analysis of solution processes and error types, the study suggests implications for the didactical application of AI language models in education.

• Research in Mathematical Education
• /
• v.5 no.1
• /
• pp.13-24
• /
• 2001

Using computer technology in teaching school mathematics creates new instructional environments. The emphases on the use of computer technology in the classrooms and in particular the use of computer-based exploration as a context of mathematics instruction have been reflected in the recommendation of the NCTM (Curriculum and Evaluation Standards for School Mathematics, 1989). Although the power of using computer technology in the exploration of mathematical problems has been recognized and stressed by many educators, we do not have many research studies on mathematics in computer-based explorations. Especially research has failed to clarify how computer technology can contribute to the construction of procedural and conceptual knowledge of mathematics. Up to now most researches on procedural and conceptual knowledge in computer environments have only focused on classifying programming languages which program language has more random access and rich interrelationship characteristic in relation to conceptual knowledge in humans, and which computer language has more characteristic flavor of procedural knowledge. How computer-based explorations affect the knowledge construction of mathematics, therefore, emerges as an issue of research on teacher education program for theoretical framework. This situation leads to do research on the effectiveness of using computer explorations in pre-service teacher education in terms of procedural and conceptual knowledge construction.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.645-655
• /
• 2002

In this Paper we consider non-deterministic finite Rabin-Scott's automata. We define special abstract objects, being pairs of values of states-marking functions. On the basis of these objects as the states of automaton, we define its edges; the obtained structure is considered also as a non-deterministic automaton. We prove, that any edge of any non-deterministic automaton defining the given regular language can be obtained by such techniques. Such structure can be used for solving various problems in the frames of finite automata theory.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.181-195
• /
• 2006

Resource-constrained project scheduling problems with variant processes can be represented and solved using a logic-based terminological language called RSV (resource constrained project scheduling with variant processes). We consider three different variants for formalizing the RSV-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the RSV- problem is NP-complete. Further we show that the optimizing variant (or number variant) of the RSV-problem is computable in polynomial time iff. the decision variant is computable in polynomial time.

• Communications of Mathematical Education
• /
• v.23 no.4
• /
• pp.1131-1148
• /
• 2009

Algebra is one of the important subjects that not only mathematics but many science major students should know at least at the elementary level. Unfortunately abstract algebra, specially, is seen as an extremely difficult course to learn. One reason of difficulties is because of its very abstract nature, and the other is due to the lecture method that simply telling students about mathematical contents. In this paper we study about the teaching and learning abstract algebra in universities in corporation of a programming language such as ISETL. ISETL is a language whose syntax closely imitates that of mathematics. In asking students to read and write code in ISETL before they learn in class, we observe that students can much understand and construct formal statements that express a precise idea. We discuss about the classroom activities that may help students to construct and internalize mathematical ideas, and also discuss about some barriers we might overcome.

• The Mathematical Education
• /
• v.45 no.2 s.113
• /
• pp.177-189
• /
• 2006

This study focuses on the analysis of prospective elementary teachers' representation of trapezoid area and teacher educator's reflecting in the context of a mathematics course. In this study, I use my own teaching and classroom of prospective elementary teachers as the site for investigation. 1 examine the ways in which my own pedagogical content knowledge as a teacher educator influence and influenced by my work with students. Data for the study is provided by audiotape of class proceeding. Episode describes the ways in which the mathematics was presented with respect to the development and use of representation, and centers around trapezoid area. The episode deals with my gaining a deeper understanding of different types of representations-symbolic, visual, and language. In conclusion, I present two major finding of this study. First, Each representation influences mutually. Prospective elementary teachers reasoned visual representation from symbolic and language. And converse is true. Second, Teacher educator should be prepared proper mathematical language through teaching and learning with his students.

• Education of Primary School Mathematics
• /
• v.21 no.2
• /
• pp.193-208
• /
• 2018

Classification is presented in the curriculum of elementary school mathematics, science, Korean language, and integrated subjects as the major function that needs to be learned. In addition, mathematics textbooks teach the classification as a basic process for organizing and interpreting collected materials in a separate unit. So, we analyzed the curriculum documents and textbooks of mathematics, science, Korean language, and integrated subjects. And we explored how to teach the classification in the context of mathematics subject. As a result, it is necessary to find different classification criteria in conjunction with detailed observation and investigation activities, and to teach that considering the circumstances and purpose of the classification. It also provided implications on how to revive converged classes that focus on big ideas and skills, which are commonly offered by various subjects.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.135-150
• /
• 2002

The present paper discusses non-deterministic finite Rabin-scott's automate. The majority of works recently dealing with this subject were, in fact, concerned only with properties of a canonical term automata or of some objects equivalent to it. This article continues the series of works in which the authors state a different point of view, describing the finite automata as just another invariant of the given regular language called basis finite automaton. In this article the authors argue on some new properties for the basis finite automaton. One of them is included into basis automaton's table of binary relations. It is stated that this table can not contain either identical strings or identical columns. Another property depicts a possibility to obtain any finite automaton for a given regular language by the process of duplicating or combining some of its states.

• The Pure and Applied Mathematics
• /
• v.29 no.1
• /
• pp.93-102
• /
• 2022

The impact of programming languages in the research sector has helped lot of researchers to broaden their view and extend their work without any limitation. More importantly, even the complex problems can be solved in no matter of time while converting them into a programming language. This convenience provides upper hand for the researchers as it places them in a comfort zone where they can work without much stress. With this context, we have converted the research problems in Topology into programming language with the help of Python. In this paper, we have developed a Python program to find the weaker form of closed sets namely alpha closed set, semi closed set, pre closed set, beta closed set and regular closed set.

• Journal of the Chungcheong Mathematical Society
• /
• v.7 no.1
• /
• pp.13-23
• /
• 1994

In this paper, we consider the higher-order type theoretic language L and construct a type model D of complete partial ordered set. We show that the complete partial ordered set for the language L gives rise to a category and generates a topos.