Search
Search Results
-
Über die Verwendung von Maple für die Simulation von Mechanismen
21-39Views:130Maple is used to do numerical computation, plot graphs and do exact symbolic manipulations and word processing. This paper demonstrates how Maple can be used for the simulation of mechanisms. This offers the possibility for students to become familiar with this particular section of mathematical modelling. The mechanism under consideration is a so-called F-mechanisms, i.e., a planar parallel 3-RRR robot with three synchronously driven cranks. It turns out that at this example it is not possible to find the poses of the moving triangle exactly by graphical methods with traditional instruments only. Hence, numerical methods are essential for the analysis of motions which can be performed by an F-mechanism. -
Algorithmics of the knapsack type tasks
37-71Views:151We propose a new kind of approach of the teaching of knapsack type problems in the classroom. We will remind you the context of the general knapsack-task and we will classify it, including the two most popular task variants: the discrete and the continuous one. Once we briefly present the solving algorithm of the continuous variant, we will focus on the solving of the discrete task, and we will determine the complexity of the algorithms, looking for different optimizing possibilities. All these issues are presented in a useful way for highschool teachers, who are preparing students in order to participate in different programming contests. -
Report of Meeting Researches in Didactics of Mathematics and Computer Sciences, April 1-3, 2022 Baja, Hungary
135-155Views:295The meeting Researches in Didactics of Mathematics and Computer Sciences was held in Baja, Hungary, at Eötvös József College, from the 1st to the 3th of April, 2022. It was organized by the Doctoral School of Mathematical and Computational Sciences of the University of Debrecen and by Eötvös József College. The 62 participants - including 18 PhD students - came from 8 countries and represented 26 institutions of higher and secondary education. There were 3 plenary and 40 session talks in the program.
-
Interactive web portals in mathematics
347-361Views:238Many of the recent problems in higher education (less contact seminars, the heterogeneity and the increasing number of our students) call for new instructional methods. At University of Szeged we have developed a mathematical web portal which can offer a solution for such problems among the changing circumstances. This freely available, easy-to-use web-surface supports interactive mathematical problem-solving and student self assessment. Our computer program cooperates with a lot of free software (computer algebra systems, formula parsers, converters, word processors). WebMathematics Interactive has been available for the public since June 2002 on its web page http://wmi.math.u-szeged.hu. -
Nice tiling, nice geometry!?!
269-280Views:148The squared papers in our booklets, or the squared (maybe black and white) pavements in the streets arise an amusing problem: How to deform the side segments of the square pattern, so that the side lines further remain equal (congruent) to each other? More precisely, we require that each congruent transformation of the new pattern, mapping any deformed side segment onto another one, leaves the whole (infinitely extended) pattern invariant (unchanged).
It turns out that there are exactly 14 types of such edge-transitive (or so-called isotoxal) quadrangle tilings, sometimes with two different forms (e.g. black and white) of quadrangles (see Figure 2). Such a collection of tiling can be very nice, perhaps also useful for decorative pavements in streets, in flats, etc.
I shall sketch the solution of the problem that leads to fine (and important) mathematical concepts (as barycentric triangulation of a polygonal tiling, adjacency operations, adjacency matrix, symmetry group of a tiling, D-symbol, etc). All these can be discussed in an enjoyable way, e.g. in a special mathematical circle of a secondary school, or in more elementary form as visually attractive figures in a primary school as well.
My colleague, István Prok [11] developed an attractive computer program on the Euclidean plane crystallographic groups with a nice interactive play (for free download), see our Figures 3-5.
A complete classification of such Euclidean plane tilings (not only with quadrangles) can be interesting for university students as well, hopefully also for the Reader (Audience). This is why I shall give some references, where you find also other ones.
Further problems indicate the efficiency of this theory now. All these demonstrate the usual procedure of mathematics and the (teaching) methodology as well: We start with a concrete problem, then extend it further, step-by-step by creating new manipulations, concepts and methods. So we get a theory at certain abstraction level. Then newer problems arise, etc.
This paper is an extended version of the presentation and the conference paper [7]. The author thanks the Organizers, especially their head Professor Margita Pavlekovic for the invitation, support and for the kind atmosphere of the conference. -
Report of meeting Researches in Didactics of Mathematics and Computer Sciences: January 30 - February 1, 2009, Debrecen, Hungary
165-186Views:147The meeting Researches in Didactics of Mathematics and Computer Sciences was held in Debrecen, Hungary from January 30 to February 1, 2009. The 49 Hungarian participants – including 15 PhD students – came from 18 cities and represented 29 institutions of higher education. The abstracts of the talks and the posters and also the list of participants are presented in this report. -
Sequenced problems for functional equations
179-192Views:140There are many possible methods to solve equations of the form H(f(x + y), f(x − y), f(x), f(y), x, y) = 0 (x, y 2 R), where H is a known function and f is the unknown function to be determined. Here we will create a sequence of problems for equations of type (1) (see on the next page). These sequenced problems are appropriate for the fostering of talented students on different level of mathematical education. -
Programming Theorems and Their Applications
213-241Views:293One of the effective methodological approaches in programming that supports the design and development of reliable software is analogy-based programming. Within this framework, the method of problem reduction plays a key role. Reducing a given problem to another one whose solving algorithm is already known can be made more efficient by the application of programming theorems. These represent proven, abstract solutions – in a general form – to some of the most common problems in programming. In this article, we present six fundamental programming theorems as well as pose five sample problems. In solving these problems, all six programming theorems will be applied. In the process of reduction, we will employ a concise specification language. Programming theorems and solutions to the problems will be given using the structogram form. However, we will use pseudocodes as descriptions of algorithms resembling their actual implementation in Python. A functional style solution to one of the problems will also be presented, which is to illustrate that for the implementation in Python, it is sufficient to give the specification of the problem for the design of the solution. The content of the article essentially corresponds to that of the introductory lectures of a course we offered to students enrolled in the Applied Mathematics specialization.
Subject Classification: D40
