Provides several algorithms that use extended precision methods to compute large factorials exactly. The programs are written in BASIC and PASCAL. The approach used for computing N considers how large N is, how the built-in limitation on exact integer representation can be bypassed, and how long it takes to compute N. (JN)

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)

The author presents two examples of lattice multiplication followed by a computer algorithm to perform this multiplication. The algorithm is given in psuedocode but could easily be given in Pascal. (PK)

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)

Presented is a way to provide students with a review and an appreciation of the versatility of pointers in data structures by improvising with binary trees. Examples are described using the Pascal programing language. (KR)

Discrete mathematics, the mathematics of decision making for finite settings, is a topic of great interest in mathematics education at all levels. Attention is being focused on resolving the diversity of opinion concerning the exact nature of the subject, what content the curriculum should contain, who should study that material, and how that…