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)

The purpose of this paper is to show, by computer examples, that very different results can be obtained by rearranging selected conditionally convergent series. Computer programs allow the students to select the real number to which they wish the rearrangement to converge. Two computer programs are appended. (KR)

Presented is a way to provide students with a review and an appreciation of the versatility of pointers in data structures by improvising with binary trees. Examples are described using the Pascal programing language. (KR)

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)

Described is a research-based instructional technique for teaching analogical reasoning by the use of guided LOGO programing activities. An example worksheet is provided illustrating the use of the Sternberg's four-step analogical reasoning technique (encode, infer, map, and apply) with LOGO programs. (Author/MDH)

Activities which may be used to investigate a variety of woven patterns are presented. Pattern predicting and analysis of different patterns are discussed. A Basic computer program for the weaving code is given. (CW)

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)

The programing language PROLOG is compared to LOGO in terms of its ability to handle mathematical ideas. This is demonstrated by using PROLOG in solving a geometric theorem and two lemmas. The listings of the computer programs used to solve the problems are included. (KR)

The objective of this presentation is to focus on the use of a hand-held graphics calculator. The specific machine referred to in this monograph is the Casio fx-7000G, chosen because of its low cost, its large viewing screen, its versatility, and its simple operation. Sections include: (1) "Basic Operations with the Casio fx-7000G"; (2) "Graphical…

Described is a mathematics resource laboratory where students use a variety of computer materials to enhance, reinforce, and broaden their concepts of first- and second-year algebra and geometry. Included are sample laboratory sheets and the answers. (KR)

Presented is an activity in which probability and percents are taught using a basketball computer simulation. Computer programs that replicate the free-throw accuracy of college and professional stars and allow students to compete with those stars are included. (KR)

Described is a learning activity which incorporates computer programing and the teaching of arrays. Using the newspaper as a source for ideas for programing assignments and classroom examples is emphasized. (KR)

Offers LOGO as an environment that facilitates the development of cognitive strategies useful in problem solving. Presents LOGO activities requiring students to combine preprogramed procedures to produce worksheet patterns. Using this approach promotes using LOGO as a vehicle for problem solving and results in a more positive attitude toward LOGO.…

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)