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)

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)

Describes the approach taken and materials used for introducing computer symbolic mathematics to undergraduate calculus students. Explains the features of the muMATH software package and reviews the modifications that were made to the program. Includes an exercise on plotting graphs. (ML)

Describes numerical differentiation and the central difference formula in numerical analysis. Presents three computer programs that approximate the first derivative of a function utilizing the central difference formula. Analyzes conditions under which the approximation formula is exact. (MDH)

This paper merges state-of-the-art calculator technology with examples drawn from the Harvard Consortium Calculus Curriculum. A brief rationale for selection of the Harvard project and the TI-85 is provided, and four different mathematical situations are examined using different capabilities of the TI-85. Two short TI-85 programs are given.…

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)

Explores the production of shadows for drawings using the LOGO computer language and Affine Geometry. Explains the methodology of the shadowing and lists the Affine Turtle procedures. Provides for different versions of LOGO. (MVL)

Presents two mathematical methods for fitting the logistic curve to population data supplied by the U.S. Census Bureau utilizing computer algebra software to carry out the computations and plot graphs. (JKK)

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)

Describes the use of simulation to introduce the bootstrapping technique of creating confidence intervals for the mean, median, and variance. These bootstrap confidence intervals are compared to the traditional confidence intervals for the purpose of analyzing accuracy of the technique. A Minitab program to produce confidence intervals is…

Uses muMATH to illustrate the step-by-step process in translating mathematical theory into the symbolic manipulation setting. Shows an application of a Picard iteration which uses a computer to generate a sequence of functions which converge to a solution. (MVL)

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)