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)

In polar coordinates, the intersection of the graphs of two functions, f(x) and g(x), does not always correspond to the solutions of the equation f(x) = g(x). Presented are examples to illustrate this concept, proofs demonstrating why this is true, and a computer program to simultaneously plot polar coordinate graphs. (MDH)

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)

Discusses activities to help students make visual generalizations about power and exponential functions, methods to determine an approximate function represented by data using logarithms, hands-on activities, and student activity sheets. Includes a Pascal Turbo computer program which generates random numbers. (MKR)

Explores alternative strategies to solve algebraic equations that do not lend themselves to traditional methods. Examines one nontraditional equation by a graphical approach using a graphing utility and by a numerical approach using spreadsheets. Discusses new basic skills for algebra utilizing technology. Provides a computer program to solve…

Presented is a series of eight hands-on exercises using Apple II computer graphics to investigate the following characteristics of periodic functions: period, amplitude, horizontal shift, and vertical shift. Detailed teacher instructions and the accompanying computer program are included. (MDH)

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

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)

Considered are several mathematical models that can be used to study different waiting situations. Problems involving waiting at a red light, bank, restaurant, and supermarket are discussed. A computer program which may be used with these problems is provided. (CW)

Focuses on the place of discrete mathematics in the grades 9-12 mathematics curriculum and discusses how the topic of recursion should be taught. Presents several examples of recursion involving LOGO, spreadsheets, sequences, Pascal's triangle, and the Tower of Hanoi to illustrate its teaching. (MDH)

Described is a solution to the problem and a discussion of a computer estimation of the probability. A computer program written in Turbo Pascal and two sample runs are provided. Computations for a more general problem of this nature and changes in the program necessary for use with Apple Pascal are appended. (CW)

Discusses the process of mathematical iteration, its benefits as a problem-solving technique, and how to teach it. Presents a selection of mathematical ideas and problems that can be solved and explored using iteration, along with related BASIC computer programs. (MDH)

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)

Discusses a calculation method to approximate pi. Describes how to get an approximation to the circumscribed and inscribed perimeters of regular polygons of n sides. Presents the computer program and result of the approximation. (YP)

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)