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

Presents a method for solving linear equations involving the use of inverses instead of memorizing rules. (MKR)

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)

A generalized method of synthetic division where the divisor polynomial may be of any degree equal to or larger than 1, and the dividend polynomial may be of equal or larger degree than the divisor polynomial and a generalization of the familiar remainder theorem, are presented. (Author/MK)

Presents an example of mathematics from an algorithmic point of view, with emphasis on the design and verification of this algorithm. The program involves finding roots for algebraic equations using the half-interval search algorithm. The program listing is included. (JN)

Two mathematical topics are interpreted from the viewpoints of traditional (performing algorithms) and contemporary (creating algorithms and thinking in terms of them for solving problems and developing theory) algorithmic mathematics. The two topics are Horner's method for evaluating polynomials and Gauss's method for solving systems of linear…

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)

An approach to using the method of least squares, a scheme for computing the best-fitting line directly from a set of points, is detailed. The material first looks at fitting a numerical value to a set of numbers. This provides tools for solving the line-fitting problem. (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)

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)

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)

Topics covered include alternate methods for finding LCM and GCF, imaginative word problems, and a primes-breakdown method of factoring quadratics. (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)

Variations on a card trick are noted, with a formula for generalizing them. Another trick which can be proved with algebraic principles is then presented. (MNS)

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…