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)

Presented is the ancient Egyptian algorithm for the operations of multiplication and division of integers and fractions. Theorems involving unit fractions, proved by Fibonacci, justifying and extending the Egyptian or Ahmes' methods into the Hindu-Arabic numeric representational system are given. (MDH)

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)

Discussed are solutions to the problem "What is the expected number of rolls for the total first to exceed 6?" Several algebraic solutions are presented. A computer program which may be used to simulate this problem is included. (CW)

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)

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)

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 LOGO subroutine turtle geometry and Euclidean geometry are compared with respect to their treatment of similarity and difference of plane figures. The problem and its proposed solution of introducing a FLIP operation are viewed briefly from the perspectives of mathematics, computer science, and education. (MDH)

Presents an algorithm to estimate pi by approximating a unit circle with a sequence of inscribed regular polygons. Demonstrates the application of the algorithm with a hand-held calculator and an Apple computer. Provides a program to calculate pi in Pascal programing language. (12 references) (MDH)

Discusses the process of mathematical iteration, its benefits as a problem-solving technique, and how to teach it. Presents a selection of mathematical ideas and problems that can be solved and explored using iteration, along with related BASIC computer programs. (MDH)

Provided are three program listings which may be used to illustrate this fractal figure. Extensions of these algorithms and their use in the study of chaos and fractals are suggested. (CW)

Illustrates how muMATH can be used for manipulating abstract differentiation rules, optimization, implicit differentiation, related rules, and verifying the chain rule. (MVL)

This report includes the framework, the experiences, the benefits, student attitude survey results, typical computer screen output, and BASIC program listings for PROBLEM, a general computer system for homework management in a time-sharing environment that can handle any exercise in which students must calculate numerical results from numerical…