Demonstrated is how the concept of equivalence classes modulo n can provide a basis for solving a wide range of problems. Five problems are presented and described to illustrate the power and usefulness of modular arithmetic in problem solving. (MNS)

Four different types of problems from graph theory are presented and discussed. (MK)

Possible ways of mechanization for counting using a binary system are discussed. Shows a binary representation of the numbers and geometric models having eight triples of lamps. Provides three problem sets. (YP)

Provides an activity as an example of how matrices can be introduced from finite graphs and how finite graphs can be analyzed by examining their matrix representations. Presents the materials, objectives, prerequisites, directions, extension activities, answers, and worksheets. (YP)

This monthly column contains teaching suggestions on: using codes to convey information, flow proofs in geometry, and volleyball and probability. (MP)

Explored are various aspects of drawing graphs on surfaces. The Euler's formula, Kuratowski's theorem and the drawing of graphs in the plane with as few crossings as possible are discussed. Some applications including embedding of graphs and coloring of maps are included. (YP)

Provides several problems and their solutions for a descriptive statistics course. Included are problems related to measurement, data collection, sample construction, applications, and computation. Discusses the misleading nature of statistics. (YP)

Discusses making tessellations by using a polyomino. Illustrates the various ways for various shapes of polyomino. Provides several diagrams and instructional guides. (YP)

Explores some classic Fibonacci problems with the aid of AppleWorks spreadsheets calculations. Provides problems and spreadsheets for solving them. (Author/YP)