A program for drawing a line segment is developed. (MNS)

An exercise simulating the tossing of N dice is described. Calculation of expected gain and extension to a two-person game are each discussed. (MNS)

Newton's method for finding roots of equations is described. How to find complex roots using the BASIC computer language is then presented, with the computer program included. (MNS)

Mathematical methods are used to study certain related Logo procedures in detail. Simple procedures with known properties are then used to build the higher-level procedures which correspond to higher-level mathematical concepts. Examples are from introductory aspects of number theory. (MNS)

Two computer programs are given to provide simulations, for any value of n, to keep count of the frequency of the first significant digit. (MNS)

APL was invented specifically as a mathematical teaching tool, and is an excellent vehicle for teaching mathematical concepts using computers. This article illustrates the use of APL in teaching many different topics in mathematics, including logic, set theory, functions, statistics, linear algebra, and matrices. (MNS)

This study concerned conceptual difficulties of college students learning programming and ways the teacher can simplify the process. An analysis of general strategies used in solving problems involving loops is given, with four types of hierarchical strategy categorized. Students had difficulty transforming their algebraic descriptions into…

An environment for investigating vector-valued functions in two- and three-dimensional space using Logo is described. The language is presented, followed by use of the environment. Appended are Logo primitives and procedures. (MNS)

Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)

A program written in PASCAL designed to find the number of binary trees possible for a given number of nodes is presented. The problem was found to be highly motivating and exciting for the group of introductory computer science students with whom it was used. (MP)

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.…

Programs are listed for integer powers and fractional powers, with discussion of how to use them in instruction. (MNS)

This article considers the sum of a finite geometric series as applied to numeric data storage in the memory of an electronic digital computer. The presentation is viewed as relevant to programing in several languages and removes some of the mystique associated with syntax constraints that any language imposes. (MP)

The introduction of certain topics in the theory of machines and languages into school and college mathematics courses in place of the more usual discussion of groups and formal logic is proposed. Examples of machines and languages and their interconnections suitable for such courses are outlined. (MP)