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)

This article, which is organized around a single, well-known algorithm for root extraction, presents a way of incorporating dynamical systems into the teaching of mathematics. Included are sample exercises using complex numbers and the computer where students have the opportunity to do some analysis on this algorithm. (KR)

Presented are exercises that demonstrate the application of standard concepts in the design of algorithms for plotting certain fractals. The exercises can be used in any course that explains the concepts of bounded or unbounded planar sets and may serve as an application in a course on complex analysis. (KR)

Described are several programs that enable the user to evaluate derivatives to order n of any elementary function by using the combination of automatic differentiation method and A Programming Language (APL). Programs calculating first- and higher-order derivatives are presented. Selected APL symbols are appended. (YP)