Presents a technique for the numerical inversion of Laplace Transforms and several examples employing this technique. Limitations of the method in terms of available computer word length and the effects of these limitations on approximate inverse functions are also discussed. (JN)

Linear ciphers, substitution ciphers, public-key cryptosystems, and trapdoor knapsacks are each discussed. (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)

Shows that the rules of thumb for propagating significant figures through arithmetic calculations frequently yield misleading results. Also describes two procedures for performing this propagation more reliably than the rules of thumb. However, both require considerably more calculational effort than do the rules. (JN)

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)

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)

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)

Provides four examples for testing the validity of logical arguments by using the method of truth trees. (YP)