Presents a classroom-tested, easy-to-use, multipurpose program (written in Applesoft BASIC) for graphing equations. A complete listing of the program (which is suitable for a wide range of applications in grades 7-12 mathematics classrooms) is included. (JN)

Presents an example of mathematics from an algorithmic point of view, with emphasis on the design and verification of this algorithm. The program involves finding roots for algebraic equations using the half-interval search algorithm. The program listing is included. (JN)

Discusses Newton's method for approximating the roots of functions, indicating that students who program in BASIC can learn and appreciate the method by writing their own programs. Includes a hypothetical dialogue between teacher and student about the topic; sample program listings; and problems assigned to students who have written programs. (JN)

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

Fractal geometry is introduced through examples of computational exploration of coastlines, self-similar curves, random walks, and population growth. These explorations, which include the construction of algorithms and the subsequent development and application of simple computer programs, lend themselves to self-directed study and advanced…

Reviewed are three computer software programs: the Astronomer (astronomy program for middle school students and older); Hands-on-Statistics: Explorations with a Microcomputer (statistics program for secondary school students and older); and CATGEN (a genetics program for secondary school students and older). Each review provides information on:…

Graphs equations in two variables using a BASIC screen-sweep program that generates solutions to equations by applying the intermediate value theorem. Provides suggestions for investigations that result in graphs of a butterfly, the Cheshire cat, the Trisectrix of Catalna, E. T. waving goodbye, a praying mantis, and others. (MDH)

Using De Moivre's theorem and a parametric graphing utility, examines powers and roots of complex numbers and allows students to establish connections between the visual and numerical representations of complex numbers. Provides a program to numerically verify the roots of complex numbers. (MDH)

A narcissistic number is a positive integer equal to the sum of its digits raised to an integral power. For example, 15 is equal to 1-cubed plus 5-cubed plus 3-cubed (a narcissistic number of order three). A computer program to find narcissistic numbers up to 10,000 is given and discussed. (JN)

Described are activities in the study of techniques used to conceal the meanings of messages and data. Some background information and two BASIC programs that illustrate the algorithms used in a new cryptographic system called "public-key cryptography" are included. (CW)

Described is a strategy that allows students to experiment with probability without applying formulas to solve problems. Students are able to intuitively develop concepts of probability before formal definitions and properties. Sample problems are included along with BASIC programs for some of the problems. (KR)

Discusses a problem involving probability and uncertainty that students can investigate experimentally or theoretically and transforms the problem to a two-player game so that students can be introduced to some fundamental concepts of decision making. Includes computer programs used to analyze the problems. (MKR)

Activities for enhancing students' understanding and interpreting of graphical information is provided. Four worksheets and answers are given. (YP)

Discussed are several different transformations based on the generation of fractals including self-similar designs, the chaos game, the koch curve, and the Sierpinski Triangle. Three computer programs which illustrate these concepts are provided. (CW)

Presented is the ancient Egyptian algorithm for the operations of multiplication and division of integers and fractions. Theorems involving unit fractions, proved by Fibonacci, justifying and extending the Egyptian or Ahmes' methods into the Hindu-Arabic numeric representational system are given. (MDH)