How set theory, combinatorics, probability, and the study of algorithms can be used in solving two problems is described in detail. Three computer programs are listed. (MNS)

Presents alternative equation-solving procedures that emphasize an examination of the steps or operations necessary to perform a calculation, followed by the inversion of those steps. The approach is especially attractive to students with limited mathematical skills. (Author/MKR)

A collection of games and puzzles that teachers can use to replace or supplement the usual textbook subtraction examples involving large numbers is given. Most of the nine activities are self-checking. (MNS)

Renaming fractions with the dot method is described with illustrations. It can be used to introduce renaming at the manipulative level in a meaningful way prior to moving to a more abstract level where prime factorization will be involved. (MNS)

Two worksheets are given, outlining algorithms to help students determine the day of the week an event will occur and to find the date for Easter. The activity provides computational practice. A computer program for determining Easter is also included. (MNS)

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)

A modern adaptation of the historic lattice algorithm which can be used for multiplication and division is discussed. How it works is clearly illustrated. (MNS)

An example of a lesson involving calculators that focused on calculator use is given. An examination of the traditional algorithm by the students led to student-directed investigations. (MP)

The author argues that children not only can but should create their own computational algorithms and that the teacher's role is "merely" to help. How children in grades K-3 add and subtract is the focus of this article. Grouping, directionality, and exchange are highlighted. (MNS)

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

Proposes that the first computer language course for students of management should teach the reading of the language rather than the writing of programs in that language. "Reading" means the study of the programing language literature, including a variety of algorithms, to understand the language, inputs, and program use. (MF)

Four procedures used by children for deriving answers to unknown subtraction facts are described. They are counting forward, counting backward, derivation, and bridging. (MP)

Described is a way to use knots to relate a three-dimensional object to a two-dimensional representation of the object. The results are used to produce an algorithm or rule to explain a general case. Included are examples, diagrams, procedures, and explanations. (KR)

The first aim in school might be to help children become more aware of the algorithmic processes they use; then, ensure that they can devise algorithms and define them. Many examples of how these aims can be met are given, including the use of calculators and computers. (MNS)

Presents cooperative computing activities in which each student plays the role of a switch or processor and acts out algorithms. Includes binary counting, finding the smallest card in a deck, sorting by selection and merging, adding and multiplying large numbers, and sieving for primes. (16 references) (Author/MKR)