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)