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)

This paper merges state-of-the-art calculator technology with examples drawn from the Harvard Consortium Calculus Curriculum. A brief rationale for selection of the Harvard project and the TI-85 is provided, and four different mathematical situations are examined using different capabilities of the TI-85. Two short TI-85 programs are given.…

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)

In this middle school mathematics unit two imaginary characters, Horatio and Portia, decide to make their fortune in Quincy Market (Boston, Massachusetts) running a Bull Market cart. In order to solve the problems that they encounter, they need to learn ratio and proportion, map reading, estimation, area and perimeter, population sampling, problem…

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…

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)

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)

Described is a recursive LOGO method for dissecting polygons into congruent parts (rep tiles) similar to the original polygon, thereby producing unexpected patterns. A list of descriptions for such dissections is included along with suggestions for modifications that allow extended student explorations into tile patterns. (JJK)

Describes numerical differentiation and the central difference formula in numerical analysis. Presents three computer programs that approximate the first derivative of a function utilizing the central difference formula. Analyzes conditions under which the approximation formula is exact. (MDH)

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)

Examined are the three regular tessellations and derived semiregular tessellations whose regular polygons meet at common vertices. Included are BASIC computer program listings that explore the various combinations of regular polygons that can form regular or semiregular tessellations. (JJK)

Provides several algorithms that use extended precision methods to compute large factorials exactly. The programs are written in BASIC and PASCAL. The approach used for computing N considers how large N is, how the built-in limitation on exact integer representation can be bypassed, and how long it takes to compute N. (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)