Computer programing and problem-solving steps in mathematics are viewed to have related concepts. Some heuristics are compared with some suggestions for structured programing. The one fundamental difference between problem solving in general and when using the computer is seen as the computer solution must be finite. The computer is viewed as a…

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)

Seven applications problems are presented for gifted students to solve by writing microcomputer programs. (MNS)

Discusses the design of computational exercises useful for a course in numerical methods for chemists. Some of the exercises make use of available programs while others require the student to write programs incorporating numerical routines. The emphasis throughout is on the use of numerical methods to solve chemical problems. (Author)

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)

Special ways of using computers as a useful tool in algebra instruction are reviewed, with applications to linear equations featured. (MP)

Suggests computer graphing as a topic for computer programing. Reviews Apple II computer graphics information and gives suggestions for writing the programs. Presents equations to help place information onto the screen with proper coordinates. (MVL)

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)

Describes ways of finding the answer to a problem for the possible sum of the three-digit numbers without using the same number repeatedly. Describes the classroom applications of the problem. Provides a computer program to obtain the solutions of the problem. (YP)

Explores the production of shadows for drawings using the LOGO computer language and Affine Geometry. Explains the methodology of the shadowing and lists the Affine Turtle procedures. Provides for different versions of LOGO. (MVL)

Presents an example of a proof to the mathematical problem of the sum of the cubes of the digits. Provides a Pascal program to search for these results. (MVL)

This student textbook is designed to incorporate programable calculators in grade 12 mathematics. The seven chapters contained in this document are: (1) Using Calculators in Mathematics; (2) Sequences, Series, and Limits; (3) Iteration, Mathematical Induction, and the Binomial Theorem; (4) Applications of the Fundamental Counting Principle; (5)…

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)

This student textbook is designed to incorporate programable calculators in grade 11 mathematics. The eight chapters contained in this document are: (1) Using Calculators in Mathematics; (2) Exponents and Logarithms; (3) Trigonometry of the Right Triangle; (4) Trigonometry Beyong the Right Triangle; (5) Graphs of the Trigonometric Functions and…

Provides a short BASIC program, RANVAR, which generates random variates for various theoretical probability distributions. The seven variates include: uniform, exponential, normal, binomial, Poisson, Pascal, and triangular. (MVL)