Examined are the three regular tessellations and derived semiregular tessellations whose regular polygons meet at common vertices. Included are BASIC computer program listings that explore the various combinations of regular polygons that can form regular or semiregular tessellations. (JJK)

The author presents two examples of lattice multiplication followed by a computer algorithm to perform this multiplication. The algorithm is given in psuedocode but could easily be given in Pascal. (PK)

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)

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)

Presented is the change-point estimation which is a variation on point estimation for a two-sample problem. This variation relies on the elementary properties of the expected value and variance operators, is intuitive and is easily accessible for introductory statistics courses. Data for this exercise may be produced by a BASIC program which is…

Identifies and proves two theorems related to expressing rational numbers in decimal form for any natural base m>1. Includes two BASIC computer programs with sample runs. (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)

Presents two mathematical methods for fitting the logistic curve to population data supplied by the U.S. Census Bureau utilizing computer algebra software to carry out the computations and plot graphs. (JKK)

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 programing language PROLOG is compared to LOGO in terms of its ability to handle mathematical ideas. This is demonstrated by using PROLOG in solving a geometric theorem and two lemmas. The listings of the computer programs used to solve the problems are included. (KR)

Three computer programs are listed for finding binomial probabilities. Other applications and variations are discussed. (MNS)

Demonstrated is the use of BASIC computer programs to simulate a binomial experiment and test a simple statistical hypothesis. The theoretical results are reached with the third programing attempt. All results, as well as computer programs, are included. (JJK)

Describes the derivation of the parameters incorporated into computer programs that are utilized to draw hypocycloids, which are the loci of points traced out by a point on a disk as it rolls against a circle and its interior. Includes information to obtain copies of the programs described. (JJK)