How set theory, combinatorics, probability, and the study of algorithms can be used in solving two problems is described in detail. Three computer programs are listed. (MNS)

Described is a simple algorithm that can be used for the input, arithmetic manipulation, and output of large integers in their exact representations. Three BASIC programs are included that apply this method to the problem of multiplication of large integers, computation of factorials, and the generation of palindromic integers. (MNS)

Programing a microcomputer to solve problems in whole-number arithmetic, rather than using the built-in operations of the computer, is described. Not only useful, it also enhances important mathematical concepts and is adaptable to a range of student abilities. (MNS)

In one school, algorithmic development has been infused in the mathematics curriculum. An example of what occurs in mathematics classes since the teachers began using the computer is given, with two students' conjectures included as well as the algebraic justification. (MNS)

Suggestions are given for having students write or modify computer programs for listing prime positive integers and continued fractions, to help them discover mathematical concepts. Sample programs are included. (MNS)

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)