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)

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)

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)

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…

The following ideas are shared: (1) a low-stress subtraction algorithm that eliminates the traditional borrowing process, and (2) an approach to graphing circular functions that looks at the process of modifying simple functions as a series of shifting, sliding, and stretching adjustments, with its biggest advantage viewed as its generality. (MP)

The first section promotes use of student notebooks in mathematics instruction as incentives for pupils to do daily work. Part two looks at a geometric interpretation of the Euclidean algorithm. The final section examines an open box problem that is thought to appear in virtually every elementary calculus book. (MP)

An unusual algorithm for approximating square roots is presented and investigated using techniques common in algebra. The material is presented as a tool to interest high school students in the logic behind mathematics. (MP)

A method is presented for determining cube roots on a calculator with square root facility that has a rapid rate of convergence. (MP)

The game of Yahtzee is discussed in terms of the various outcomes of turns in the game and their point values and the probabilities associated with achieving specific combinations of dice values. Several tables and methods of table construction are noted, and several challenge exercises are included. (MP)

Attention is drawn to an ancient Greek method for finding the least common multiple (LCM) of two numbers. A link is established between this method and a well-known method of obtaining the highest common factor (HCF) numbers. This leads to consideration of some relationships between HCF and LCM. (Author/MK)