The first section of this course on programming introduces LISP as a programming language designed to do symbol manipulation, with consequent prevalence in auto-instructional (AI) work. A programming language specifies in its description a number of primitive operations which the computer knows how to perform. An algorithm is the set of…

Defines all recurrence relations used in the Nuffield course, to solve first- and second-order differential equations, and describes a typical algorithm for computer generation of solutions. (Author/GA)

The observations of a fifth-grade student concerning number patterns are recorded and discussed. (SD)

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)

The Fibonacci Sequence describes a vast array of phenomena from nature. Computer scientists have discovered and used many algorithms which can be classified as applications of Fibonacci's sequence. In this article, several of these applications are considered. (PK)

Describes activities in a mathematics class for six-year-olds. The article makes several points, including: working independently is very absorbing; investigative work is as important as algorithms; and children working in groups can achieve more than even the brightest child working alone. (PK)

The author advocates a return to "traditional" elementary algebra content. Several roles for algebra manipulation are identified, including making arithmetic more interesting and understandable and providing facility indispensable for both the technician and the mathematician. (PK)

New theory and practice in testing is replacing the standard test by the test item bank and classical test theory by item response theory. Eight papers and a commentary are presented in this special issue concerning test item banking. (SLD)

In spite of current sentiment to the contrary, the wellsprings of mathematics are not utility and relevance, but creativity, imagination, and an appreciation of the beauty of the subject. This has implications for the teaching of mathematics. (PK)

Describes an algorithm that provides more rapid convergence for more complicated forms of phase separation requiring the use of a digital computer. Demonstrates that this "inside-out" algorithm remains efficient for determination of the equilibrium states for any type of phase transition for a binary system. (CW)

The first aim in school might be to help children become more aware of the algorithmic processes they use; then, ensure that they can devise algorithms and define them. Many examples of how these aims can be met are given, including the use of calculators and computers. (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)

A "neat and general" divisibility algorithm for prime numbers is presented. Five illustrative examples are included. (MNS)

Reports algorithm for calculation of term discrimination values that is sufficiently fast in operation to permit use of exact values. Evidence is presented to show that relationship between term discrimination and term frequency is crucially dependent upon type of inter-document similarity measure used for calculation of discrimination values. (13…

This study of training needs utilized a questionnaire to assess participant's opinions of knowledge level that should exist and knowledge level that does exist in 25 content areas and analyzed the resultant data using three different approaches: mean difference analysis, multicomponent data analysis, and weighted need index. (MBR)