Presented are the mathematical explanation of the algorithm for representing rational numbers in base two, paper-and-pencil methods for producing the representation, some patterns in these representations, and pseudocode for computer programs to explore these patterns. (MNS)

Examines similarities between composition and programming processes, and reviews two studies that linked instruction in computer programming and freshman composition to help students understand writing as a design discipline. Projects at the University of Montana and Bryn Mawr College which improved students' writing abilities are described. (LRW)

Discusses the differences between problems and exercises in chemistry, and some of the difficulties that arise when the same methods are used to solve both. Proposes that algorithms are excellent models for solving exercises. Argues that algorithms not be used for solving problems. (TW)

Discusses the difference between a generic chemistry problem (one which can be solved using an algorithm) and a harder chemistry problem (one for which there is no algorithm). Encourages teachers to help students recognize these categories of problems so they will be better able to find solutions. (TW)

Discusses the differences between problems and exercises, the levels of thinking required to solve them, and the roles that algorithms can play in helping chemistry students perform these tasks. Proposes that students be taught the logic of algorithms, their characteristics, and how to invent their own algorithms. (TW)

Reports on a study into the problem solving abilities of students in a Jamaican high school who were intentionally taught problem solving strategies during one-sixth of their mathematics instruction for one academic year. Results indicated no significant increases in their performance on a problem solving test. (TW)

Computing pi efficiently has been of great interest to mathematicians for centuries. This article presents an algorithm to solve this problem through skillful computer use. (PK)

This article illustrates how questions from elementary finance can serve as motivation for studying high order powers, roots, and exponential functions using Logo procedures. A second discussion addresses a relatively unknown algorithm for the trigonometric exponential and hyperbolic functions. (PK)

The article discusses the use of computers to teacher college level mathematics. In particular, the Gaussian elimination procedure for solving a system of n linear equations in n unknowns, using a computer, is examined. (PK)

Explains the use of the 3-dimensional analytic geometry method to find values for a field geology problem. Gives a description of the mathematical theory for this method which can be applied to data obtained by drilling as well as open surfaces, and a computer program. (RT)

The author suggests that, through using the outlined question model and suggested classroom activities, elementary students will improve their abilities to analyze routine, one-step word problems and make a plan for the solution. It is further argued that the same algorithm can be applied to multistep problems by using specified questions. (PK)

Categories of facilities utilization and scheduling requirements to be considered when using a heuristic approach to timetabling are described together with a nine-step algorithm and the computerized timetabling system, Timetable Schedules System (TTS); TTS utilizes heuristic approach. An example demonstrating use of TTS and a program flowchart…

Results from the 1979 Minnesota Computer Literacy Assessment show that eighth- and eleventh-grade females perform better than males in some specific areas of programing, i.e., those that involve problem analysis and algorithmic application where the problems are expressed verbally rather than mathematically. (Author/LRW)

Students from six fourth-grade classes were paired and randomly assigned to computer or worksheet treatments on multiplication and division. Those using computer-based drill-and-practice programs made greater gains on some tests of basic facts, but had no higher retention of algorithms. (MNS)

Explores potential of mathematical theory of communication for information science and examines question of how to encode a message at time it is encountered for subsequent recall. Examples of problem, a prototype computer program and experiment, coding as embedding in associational nets, and nature of information are discussed. (Nine references.)…