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

Provides an algorithm for determining the median and quartiles of discrete data sets. Describes the graphical equivalent of the numerical method. (JM)

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)

Presents a theorem and its converse to generate all of the primitive Pythagorean quadruples. Provides a BASIC program generating them. (YP)

Discusses a numerical technique called the method of adjoints, turning a linear two-point boundary value problem into an initial value problem. Described are steps for using the method in linear or nonlinear systems. Applies the technique to solve a simple pendulum problem. Lists 15 references. (YP)

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)

Considered are what discrete mathematics includes, some parallels and differences between new math and discrete mathematics (listed in a table), and lessons to be learned. A list of references is included. (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)

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)