An exhibit at the San Francisco Exploratorium is used to discuss problem solving and illustrate optimization. The solution is discussed in detail. (MNS)

Discusses (in 10 sections) some problem-solving techniques that are typically encountered in a first course in discrete mathematics. Sections (which include exercises) are titled: draw a figure; search for a pattern; mathematical induction; one-to-one correspondence; recurrence relations; generating functions; calculus; finite differences; and…

A possible method of derivation of prescriptions for solving problems, found in Babylonian cuneiform texts, is presented. It is a kind of "geometric algebra" based mainly on one figure and the manipulation of or within various areas and segments. (MNS)

The Mathematical Olympiad Training Session is designed to give United States students a problem-oriented exposure to subject areas (algebra, geometry, number theory, combinatorics, and inequalities) through an intensive three-week course. Techniques used during the session, with three sample problems and their solutions, are presented. (JN)

Computer graphics are used to display the sum of the first few terms of the series solution for the problem of the vibrating string frequently discussed in introductory courses on differential equations. (MNS)

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)

Mathematical models that are used to solve facility location problems are presented. All involve minimizing some distance function. (MNS)

Algorithms to determine the optimal locations of emergency service centers in a given city are presented, with theorems and proofs. (MNS)

A slight rewording can often transform a routine exercise into a nonroutine one. Three problems (with solutions) from first-year college calculus are presented to illustrate how the technique can be used and how it is applicable to any course. (JN)

The author arranges 26 current states of mathematical knowledge (in relation to solving a problem) in an informal taxonomy and comments on them. (MNS)

Considered is the open-ended question of the various means of marking an n-inch ruler so that the distance of any integral number of inches from 1 to n can be ascertained with a single measurement. The relationship between a sparsely marked ruler, which is one gracefully marked with the fewest number of marks, and specific discrete graphs is…

The problem of managing the reserve of cobalt is presented, followed by a method for bringing the stockpiled amount from any level to a desired goal. Solving a stochastic programming problem is involved. The procedure is discussed in detail. (MNS)

The problem of controlling the grizzly bear population at Yellowstone is described. The results are presented in graphical form and discussed. A computer program is included. (MNS)

Clapping music for two performers provides the basis for a series of mathematical problems in combinatorics and group theory. A discussion provides insight about how to avoid overlooking global extrema in constrained max-min problems when solving systems of algebraic equations. (JJK)

Describes an experiment to determine which of four objects, hollow cylinders, solid cylinders, hollow balls, and solid balls, will reach the bottom of an inclined plane first when released simultaneously. Provides solutions to the problem and supplementary exercises. (MDH)