The problem of getting a correct result when a fraction is reduced by cancelling a digit which appears in both the numerator and the denominator is extended from the base ten situation to any number base. (DT)

Algorithms are developed and presented for the addition and multiplication of positive rational numbers using only their repeating decimal representation. (MN)

In a thesis written for the Doctor of Arts in Mathematics, the connection between Euclid's algorithm and continued fractions is developed and extended to n dimensions. Applications to computer sciences are noted. (SD)

The problem of finding cube roots when limited to a calculator with only square root capability is discussed. An algorithm is demonstrated and explained which should always produce a good approximation within a few iterations. (MP)

The theory of unary and binary operations are discussed and illustrated with examples from school mathematics. Presentations of selected inverse operations are made and attention is drawn to certain "typical" problems that occur during instruction and learning of these concepts. (MP)

The author presents two examples of lattice multiplication followed by a computer algorithm to perform this multiplication. The algorithm is given in psuedocode but could easily be given in Pascal. (PK)

Computing pi efficiently has been of great interest to mathematicians for centuries. This article presents an algorithm to solve this problem through skillful computer use. (PK)

This document analyzes one chapter of a textbook for college remedial mathematics. This analysis is done by one of the textbook authors. The chapter under discussion deals with fractions. The text authors, writing from a constructivist perspective, attempted to write problems which not only developed specific conceptual and heuristic objectives…