Linear ciphers, substitution ciphers, public-key cryptosystems, and trapdoor knapsacks are each discussed. (MNS)

The general algorithm used in most hand calculators to approximate elementary functions is discussed. Comments on tabular function values and on computer function evaluation are given first; then the CORDIC (Coordinate Rotation Digital Computer) scheme is described. (MNS)

Described are ways that errors of magnitude can be unwittingly caused when using various supercalculator algorithms to solve linear systems of equations that are represented by nearly singular matrices. Precautionary measures for the unwary student are included. (JJK)

A possible method of derivation of prescriptions for solving problems, found in Babylonian cuneiform texts, is presented. It is a kind of "geometric algebra" based mainly on one figure and the manipulation of or within various areas and segments. (MNS)

Provides several algorithms that use extended precision methods to compute large factorials exactly. The programs are written in BASIC and PASCAL. The approach used for computing N considers how large N is, how the built-in limitation on exact integer representation can be bypassed, and how long it takes to compute N. (JN)

The forum is focused on thinking about and with algorithms as a way of unifying all one's mathematical endeavors. The lead article by Maurer presents examples and discussion of this point. Responses, often disagreeing with his views, are by Douglas, Korte, Hilton, Renz, Smorynski, Hammersley, and Halmos. (MNS)

The Euclidean algorithm for finding the greatest common divisor is presented. (MNS)

Mathematical models that are used to solve facility location problems are presented. All involve minimizing some distance function. (MNS)

Algorithms to determine the optimal locations of emergency service centers in a given city are presented, with theorems and proofs. (MNS)

The evolution of Archimedes' method is traced from its geometrical beginning as a means to approximate pi to its modern version as an analytical technique for evaluating inverse circular and hyperbolic functions. It is felt the web of old and new algorithms provides considerable instructional material, and ideas are offered. (MP)

Results of this study indicated calculator algorithms can serve as an effective alternative instructional strategy where computational skill is an instructional goal. (MP)

A program for drawing a line segment is developed. (MNS)

An efficient division algorithm is developed, using a computer program, to convert any positive fraction to its decimal representation. The computer program listing is included. (MNS)

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)

Three teaching ideas are presented: how to present changes between scientific notation and decimal form that eliminate some student confusion; an analysis of an incorrect algebra equation that produced a correct answer; and aspects of a standard calculus problem dealing with minimum and maximum values. (MP)