Some of the important concepts in recursive programing are detailed, along with how they can be used. Examples are provided to show how to program recursively in BASIC. (MP)

A mathematical technique for solving for the interest rate of a given annuity is explained. The technique is applied to a BASIC program that finds interest rate given the future value, number of payments, and the value of the payment. (MP)

There are many uses for the shortest path algorithm presented which are limited only by our ability to recognize when a problem may be converted into the shortest path in a graph representation. (Author/TG)

The authors suggest a few games for which programmable pocket calculators are used to create an environment in which mathematical concepts can be experienced more easily by students. (Author/MK)

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)

Presented is a computer program written in BASIC that covers round-robin schedules for team matches in competitions. The program was originally created to help teams in a tennis league play one match against every other team. Part of the creation of the program involved use of modulo arithmetic. (MP)

A hungry worm is looking for something to eat according to very specific rules, and the path he takes is a graph. The problem is detailed in Applesoft BASIC using low resolution graphics for worms that turn 90 degrees and high resolution for worms that can turn 45 degrees. (MP)

The discrete mathematics topics of trees and computational complexity are implemented in a simple reliability program which illustrates the process advantages of the PASCAL programing language. The discussion focuses on the impact that reliability research can provide in assessment of the risks found in complex technological ventures. (Author/JJK)

The relation between mathematical and computational aspects of recursion are discussed and some examples analyzed. Definition, proof, and construction are considered, as well as their counterparts in computer languages (illustrated with Logo procedures). (MNS)

The use of Logo to develop mathematical concepts is advocated. Children's comments as they work with Logo are presented. (MNS)

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)

The results of the interaction of fifth- and sixth-grade students with a computer are described. (MK)

The authors develop the idea of Niven numbers and discuss their potential usefulness in the classroom. A computer program to generate Niven numbers is provided. (MK)

Material covers: (1) What Is a Mathematical Concept; (2) How are Mathematical Concepts Developed; (3) How Can Computers Help Children Learn Concepts; (4) Using Software; (5) Writing Programs; and (6) What Must We Do. Using software and writing programs are two very different experiences, but both can enhance concept development processes. (MP)

Problems are presented that can be solved with a microcomputer which explore the binary, decimal, and hexadecimal number systems and related problems. (Author/TG)