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)

Use of the computer programs provided here in APL programming language can help students understand computational algorithms. (SD)

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)

Details are given of a simple computer program written in BASIC which calculates the sine of an angle through an application of DeMoivre's Theorem. The program is included in the material, and the program's success is discussed in terms of why the approximation works. (MP)

The theory of unary and binary operations are discussed and illustrated with examples from school mathematics. Presentations of selected inverse operations are made and attention is drawn to certain "typical" problems that occur during instruction and learning of these concepts. (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)

A procedure for constructing a magic cube is presented, with related teaching activities appropriate for students familiar or unfamiliar with the algorithm covered. (MP)

The intent of this paper is to suggest and illustrate how electronic hand-held calculators, especially non-programmable ones with limited data-storage capacity, can be used to advantage by students in one particular aspect of work with polynomial functions. The basic mathematical background upon which calculator application is built is summarized.…

A method for teaching students to solve complex algebraic equations is described. The method, which relies on sequentially reducing the complexity of the problem has been successfully used with secondary students and in remedial college courses. (SD)

Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)

An unusual alternative starting point for instruction in a beginning calculus course that focuses on Fixed Point Iteration (FPI) is presented. (MP)

In this paper, prepared for a European conference on mathematics education, the author examines three types of computer use in undergraduate and high school classrooms: Using the computer as an instructional tool for student development of algorithms, teaching about the computer itself, and use of computer-assisted instruction. (SD)

Some concrete examples of the use of historical materials in developing certain topics from precalculus and calculus are presented. Ideas which can be introduced with a reformulated curriculum are discussed in five areas: algorithms, combinatorics, logarithms, trigonometry, and mathematical models. (MNS)

Provides a short list of integral triples for the design of problems employing unit fractions (so solutions will be positive integers). Also presents an algorithm whereby both primary and imprimitive sets of triples can be easily obtained and shows how to extend the algorithm to solve three-variate unit fraction equations. (JN)

The merits of having students interact with the computer rather than use canned programs to solve problems are discussed. Examples are provided. (SD)