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)

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…

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)

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)

Shows how to model Newton's method for approximating roots on a spreadsheet. (MKR)

Raises and responds to questions about what and how to teach mathematics with the availability of calculators to all students. Discusses whether students need basic facts, mechanical skills, and knowledge of computational algorithms. Argues that students need to develop number sense and analytical skills using simple, symbolic, and graphing…

In one school, algorithmic development has been infused in the mathematics curriculum. An example of what occurs in mathematics classes since the teachers began using the computer is given, with two students' conjectures included as well as the algebraic justification. (MNS)

The four-color theorem stating that any map in a plane can be colored using no more than four colors represents a problem suitable for the liberal arts student. Presented is an algorithm for coloring familiar maps through the temporary removal of states bordering three or fewer states. (MDH)

Presents an algorithm to estimate pi by approximating a unit circle with a sequence of inscribed regular polygons. Demonstrates the application of the algorithm with a hand-held calculator and an Apple computer. Provides a program to calculate pi in Pascal programing language. (12 references) (MDH)

Described is a learning activity that requires students to write a manual to explain how to apply procedures and algorithms used in mathematics. A list of possible precalculus and calculus topics that can be used in this activity is included. (KR)