Circuits are described, with discussion on how to help students find the algorithms to solve a variety of problems involving circuits. (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)

Two algorithms are developed for finding the square roots of numbers. One is based on the rule that x square is the sum of the first x odd numbers; the other is algebraic. (MP)

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…

An algorithm for multiplying natural numbers is described. The algorithm provides a chance for some unusual drill and might serve as an enrichment topic. (MK)

Shortcuts to use when performing operations with the calculator are given. Algorithms discussed include reciprocals, powers, parentheses, infinite series, and synthetic division. (MP)

Described is a simple algorithm that can be used for the input, arithmetic manipulation, and output of large integers in their exact representations. Three BASIC programs are included that apply this method to the problem of multiplication of large integers, computation of factorials, and the generation of palindromic integers. (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 following ideas are shared: (1) a low-stress subtraction algorithm that eliminates the traditional borrowing process, and (2) an approach to graphing circular functions that looks at the process of modifying simple functions as a series of shifting, sliding, and stretching adjustments, with its biggest advantage viewed as its generality. (MP)

Problems with apportioning seats within the House of Representatives every 10 years are discussed. The history of the problem and the nature of the politics involved are reviewed, and the current method in use is detailed along with its flaws. A call for a more sensible system is made. (MP)

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)

Presents two methods for replacing a series by one converging more rapidly: regrouping the terms of a series and manipulations of power series. Describes a general algorithm for approximating the natural logarithm of any number. (YP)

Reports on the findings of the Algorithms working group at the Ware, England, conference. Examines methods of introducing the algorithmic approach to mathematics via computer programing and using problems arising from content areas. Considers programing language and presents support for programming in mathematics curricula. (JM)

The problem of finding cube roots when limited to a calculator with only square root capability is discussed. An algorithm is demonstrated and explained which should always produce a good approximation within a few iterations. (MP)