Provides a BASIC program to compute the number of shuffles required for packs containing even numbers of cards up to 100. Lists 4 further questions on the shuffling program. (YP)

Shows a series of Euclidean equations using the Euclidean algorithm to get the greatest common divisor of two integers. Describes the use of the equations to generate a series of circles. Discusses computer generation of Euclidean circles and provides a BASIC program. (YP)

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)

Outlines an articulation program between college and industry. Describes three seminar courses using the college's computer system. Considers the benefits of the program. (Author/YP)

A FORTRAN program is provided for use with computer projects for a course in number theory. Uses diminishing functions and the speed of the computer to quickly determine possible solutions to problems. (MVL)

Presents a program for the Apple II computer that teachers can use for exam questions and homework assignments. Prints out all cubic polynomials whose roots, maximum and minimum points, and points of inflection are all integers. (MVL)