The aim of this study is to examine how algorithmatizing tasks engage mathematics students in algorithmic thinking. Structured, task-based interviews were conducted with eight Year 12 students as they completed a sequence of algorithmatizing tasks involving maximum flow problems. A deductive-inductive analytical process was used to first classify…

Previous studies have found positive effects of Game-Based Learning for mathematics. While most studies assume that this effect is explained by the presence of flow/immersion during games, this has not yet been established. The aim of the current study is to verify if immersion indeed is associated with mathematical skills improvement when using a…

A method for solving inequalities of degree greater than one is described. (MK)

An alternate method for factoring quadratic equations is presented as being quicker and easier to use than the trial-and-error method. (MP)

Circuits are described, with discussion on how to help students find the algorithms to solve a variety of problems involving circuits. (MNS)

A generalized method of synthetic division where the divisor polynomial may be of any degree equal to or larger than 1, and the dividend polynomial may be of equal or larger degree than the divisor polynomial and a generalization of the familiar remainder theorem, are presented. (Author/MK)

Two algorithms are developed for finding the square roots of numbers. One is based on the rule that x square is the sum of the first x odd numbers; the other is algebraic. (MP)

Presents an example of mathematics from an algorithmic point of view, with emphasis on the design and verification of this algorithm. The program involves finding roots for algebraic equations using the half-interval search algorithm. The program listing is included. (JN)

Two mathematical topics are interpreted from the viewpoints of traditional (performing algorithms) and contemporary (creating algorithms and thinking in terms of them for solving problems and developing theory) algorithmic mathematics. The two topics are Horner's method for evaluating polynomials and Gauss's method for solving systems of linear…

Common mistakes pupils make when adding fractions are categorized and analyzed. (MP)

The article presents a general test for divisibility that includes composite numbers and shows that such a test can be used to determine divisibility by several numbers simultaneously. (MK)

An algorithm for multiplying natural numbers is described. The algorithm provides a chance for some unusual drill and might serve as an enrichment topic. (MK)

Described is a simple algorithm that can be used for the input, arithmetic manipulation, and output of large integers in their exact representations. Three BASIC programs are included that apply this method to the problem of multiplication of large integers, computation of factorials, and the generation of palindromic integers. (MNS)

Considered are what discrete mathematics includes, some parallels and differences between new math and discrete mathematics (listed in a table), and lessons to be learned. A list of references is included. (MNS)

Suggests and illustrates ways in which systematic consideration of selected unary operations can be facilitated by using electronic calculators. Emphasis is placed upon unary operations suitable for exploration and investigation at the pre-algebra level, using calculation algorithms as a basis for generating examples and non-examples to develop…