There are many uses for the shortest path algorithm presented which are limited only by our ability to recognize when a problem may be converted into the shortest path in a graph representation. (Author/TG)

Suggestions for teaching the concept of division by zero are given. (MK)

Presents two methods for replacing a series by one converging more rapidly: regrouping the terms of a series and manipulations of power series. Describes a general algorithm for approximating the natural logarithm of any number. (YP)

The "word problem" is stated for a given collection. Facts regarding Dehn's Algorithm, definition of Thue systems, a rewriting system, lemmas and corollaries are provided. The situation is examined where the monoid presented by a finite Thue system is a group. (DC)

Discrete mathematics and finite mathematics differ in a number of ways. First, finite mathematics has a longer history and is therefore more stable in terms of course content. Finite mathematics courses emphasize certain particular mathematical tools which are useful in solving the problems of business and the social sciences. Discrete mathematics…

Develops a division algorithm in terms of familiar manipulations of concrete objects and presents it with a series of questions for diagnosis of students' understanding of the algorithm in terms of the concrete model utilized. Also offers general guidelines for using concrete illustrations to explain algorithms and other mathematical principles.…

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)

An approach to how to expand explorations of determinants is detailed that allows evaluation of the fourth order. The method is built from a close examination of the product terms found in the expansions of second- and third-order determinants. Students are provided with an experience in basic mathematical investigation. (MP)

Shows how to model Newton's method for approximating roots on a spreadsheet. (MKR)

The discrete mathematics topics of trees and computational complexity are implemented in a simple reliability program which illustrates the process advantages of the PASCAL programing language. The discussion focuses on the impact that reliability research can provide in assessment of the risks found in complex technological ventures. (Author/JJK)

Instruction on properties of whole numbers, the meanings of operations on whole numbers, symbolic representation and algorithms for completing these operations is discussed. Many activities appropriate to each of these topics, and suitable for primary school children, are presented. (SD)

An attempt is made to show that algebra is rarely obvious, and merely expecting children to learn rules is an oversimplification. Sections cover: (1) The Non-visual Nature of Algebra; (2) The Apparently Arbitrary Nature of Algebra; (3) The Relationship Between Symbolism, System and Question; (4) The Complex Nature of Algebra; and (5) Some…

The trick focuses on a theorem that the sum of the digits of the difference between any natural number and the sum of its digits is divisible by nine. Two conditions of using the trick are noted. The reason that the theorem works is established through a proof. (MP)

A teaching sequence for the division algorithm is detailed. (MP)

The ideas and techniques involved in learning about fractions were investigated with students in grades 1-12, in the first 3 years of colleges, in community college mathematics courses, and in graduate school. Also included were some high school mathematics teachers, some mathematicians, and some retired persons. Part I provides the rationale and…