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…

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)

Presents several ways that the microcomputer can be used as an aid in teaching various topics in calculus, including graphing functions, solving equations, finding limits and derivatives, and solving optimization problems. Emphasizes the use of computer software that tends to maximize the potential of computer graphics in mathematics instruction.…

Discusses the use of Logo tools, spinners, dice, and coins for creating and understanding probability. Gives procedures for devising a spinner board and other necessary functions for performing the activity. Presents ideas for extending the experiment. (RT)

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)

This article, which is organized around a single, well-known algorithm for root extraction, presents a way of incorporating dynamical systems into the teaching of mathematics. Included are sample exercises using complex numbers and the computer where students have the opportunity to do some analysis on this algorithm. (KR)

Examines the use of the computer to approximate the value of the definite integral normally calculated by mathematical means. Presents four examples using BASIC programs to approximate single and double integrals by numerical integration and the Monte Carlo method. Programs are provided. (MDH)

A FORTRAN program is provided for use with computer projects for a course in number theory. Uses diminishing functions and the speed of the computer to quickly determine possible solutions to problems. (MVL)

Described is a short program for teaching and learning about geometric transformations. The integration of geometry problem solving and BASIC programing is discussed. Applications of computer graphics are illustrated. (CW)

Utilizes LOGO to teach the concept of inequalities by programing the turtle to take random walks in the coordinate plane restricted to predetermined regions defined by inequalities. The students task is to discover the inequalities that define the illegal areas into which the turtle must not move. Provides examples and corresponding computer…

Explains graphing functions when using LOTUS 1-2-3. Provides examples and explains keystroke entries needed to make the graphs. Notes up to six functions can be displayed on the same set of axes. (MVL)

Presented are exercises that demonstrate the application of standard concepts in the design of algorithms for plotting certain fractals. The exercises can be used in any course that explains the concepts of bounded or unbounded planar sets and may serve as an application in a course on complex analysis. (KR)