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)

Discusses a computer calculus game which follows the path of a parabola in stepwise progression. The educational value of the game is a simple example of nonlinearity, a subject which is just beginning to earn some attention in the mathematical community. The Applesoft program listing is included. (JN)

Presents four probability problems, their simulations, and analyses. The first illustrates a discrete situation for which it is possible to list the sample space. The second and third are continuous--the number of possible outcomes is infinite. The last is discrete with a surprising continuous extension question which leads to l/e. (JN)

A narcissistic number is a positive integer equal to the sum of its digits raised to an integral power. For example, 15 is equal to 1-cubed plus 5-cubed plus 3-cubed (a narcissistic number of order three). A computer program to find narcissistic numbers up to 10,000 is given and discussed. (JN)

Discusses a calculation method to approximate pi. Describes how to get an approximation to the circumscribed and inscribed perimeters of regular polygons of n sides. Presents the computer program and result of the approximation. (YP)

Described are ways that specific concepts from abstract algebra can be programed using the software package features of the Ada Programming Language, which is the primary language of the Department of Defense. Included are typical programs with their respective outputs. (JJK)

Examples of subroutines that generate both symbolic and graphic solutions to differential equations are presented for the two computer algebra systems, MAPLE and Mathematica. Included are the listings for the Mathematica procedures developed for use in this article. (JJK)

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)

The purpose of this paper is to show, by computer examples, that very different results can be obtained by rearranging selected conditionally convergent series. Computer programs allow the students to select the real number to which they wish the rearrangement to converge. Two computer programs are appended. (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)

Presents an example of a proof to the mathematical problem of the sum of the cubes of the digits. Provides a Pascal program to search for these results. (MVL)

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)

The programing language PROLOG is compared to LOGO in terms of its ability to handle mathematical ideas. This is demonstrated by using PROLOG in solving a geometric theorem and two lemmas. The listings of the computer programs used to solve the problems are included. (KR)

Notes muMATH is a powerful computer algebra systems assistant for performing symbol manipulation in algebra and calculus. Provides several examples and program listings for calculus tutoring, differentiation drill problems, and integration drill problems. (MVL)

Provides a short BASIC program, RANVAR, which generates random variates for various theoretical probability distributions. The seven variates include: uniform, exponential, normal, binomial, Poisson, Pascal, and triangular. (MVL)