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

Describes a lesson on long division using chip trading which follows that algorithm for long division. (MKR)

The mathematics associated with division is discussed, working from a theorem for the real division algorithm. Real-world, geometric, and algebraic approaches are discussed, as are related topics. (MNS)

A technique for doing long division without the usual estimation difficulty is presented. It uses multiples of 2 combined with a recording technique. (MNS)

Discusses an algorithm that converts a fraction in simplest form into a terminating decimal and allows students to explore the efficacy and conceptual bases of a mathematical algorithm. (ASK)

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

Two difficulties that students have in computing with fractions are idenfitied. Then a procedure is described, stressing the identity element, that resolves these difficulties and increases students' understanding and retention. (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)

Suggests that issues surrounding the teaching of algorithms focus not on whether to teach them but rather on balancing and connecting the development of algorithmic thinking. Presents an approach to help students develop their algorithmic thinking. Contains 18 references. (ASK)

Circuits are described, with discussion on how to help students find the algorithms to solve a variety of problems involving circuits. (MNS)

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)

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)

Computational algorithms from American textbooks copyrighted prior to 1900 are presented--some that convey the concept, some just for special cases, and some just for fun. Algorithms for each operation with whole numbers are presented and analyzed. (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)