Problems which can be solved or partially solved by the Gregory Interpolation Formula are presented. The formula is explained and applied to three problems. (MNS)

A sample of novel verbal problems which can be solved by using systems of linear equations with free variables is presented. The procedure of Gaussian elimination is used to solve the system. (KR)

Addresses the principles and problems associated with the use of significant figures. Explains uncertainty, the meaning of significant figures, the Simple Rule, the Three Rule, and the 1-5 Rule. Also provides examples of the Rules. (ML)

Describes three studies in which students (N=515; N=60; N=135) were asked to indicate appropriate operations and numbers used in solving open mathematical sentences. Analysis of data and interviews suggest two error patterns: "finding a solution" and "inverse operation." Indicates that "finding a solution" strategy…

Derives the current in the wire joining two points when n points are joined two by two by wires of equal resistance, and two of them are connected to the electrodes of a battery of electromotive force E and resistance R. (YP)

Investigates the problem of finding the expected number of questions necessary to identify 1 out of a set of 30 attribute blocks. Solutions include the use of a tree diagram or a computer simulation. Generalizes the problem for increased numbers of attributes. (MDH)

A series of well-defined steps is given for solving titrimetric problems, based on the mole concept. An example is given, including calculations from the first step to the last. (SA)

Discusses the use of the recursive method to permutations of n objects and a problem making c cents in change using pennies and nickels when order is important. Presents a LOGO program for the examples. (YP)

Discusses solving inequality problems involving linear programing. Describes the usual and alternative approaches. Presents an intuitive approach for finding a feasible solution by maximizing the objective function. (YP)

Presents a public-key cryptosystem application to introduce students to several topics in discrete mathematics. A computer algorithms using recursive methods is presented to solve a problem in which one person wants to send a coded message to a second person while keeping the message secret from a third person. (MDH)

Use of the calculator to create a series of iterations to approximate i to some desired degree of accuracy is illustrated with three problems on interest rates. (MNS)

Presented are two problems that can be solved using a computer simulation by students who have completed Algebra II. The distance and bisector formulas and the various forms of the equations of a circle and straight line are the topics. Computer program listings are included. (MNS)

Plotting a polynomial over the range of real numbers when its derivative contains complex roots is discussed. The polynomials are graphed by calculating the minimums, maximums, and zeros of the function. (MNS)

Discusses the use of mathematical modeling. Describes types, examples, and importance of mathematical models. (YP)

Discusses a misconception about the cycloid that asserts the final point on the path of shortest time in the "Brachistochrone" problem is at the lowest point on the cycloid. Uses a BASIC program for Newton's method to determine the correct least-time cycloid. (MDH)