A basketball player attempting a free throw has two parameters under his or her control: the angle of elevation and the force with which the ball is thrown. We compute upper and lower bounds for the initial velocity for suitable values of the angle of elevation, generating a subset of the configuration space of all successful free throws. A…

To compute the probability of having a disease, given a positive test result, is a standard probability problem. The sensitivity and specificity of the test must be given and the prevalence of the disease. We ask how a test-maker might determine the tradeoff between sensitivity and specificity. Adding hypothetical costs for detecting or failing to…

An attempt to model the physical process of annealing lead to the development of a type of combinatorial optimization algorithm that takes on the problem of getting trapped in a local minimum. The author presents a Microsoft Excel spreadsheet that illustrates how this works.

Reviews for three software packages are given. Those packages are: Linear Algebra Computer Companion; Probability and Statistics Demonstrations and Tutorials; and Math Utilities: CURVES, SURFS, AND DIFFS. (PK)

Discusses copyright laws applied to computer software for professors, students, and institutions. Concepts including infringement, contributory infringement, first sale doctrine, and licenses are considered. A sample university policy statement to avoid liability is presented. (YP)

Provides several algorithms that use extended precision methods to compute large factorials exactly. The programs are written in BASIC and PASCAL. The approach used for computing N considers how large N is, how the built-in limitation on exact integer representation can be bypassed, and how long it takes to compute N. (JN)

Computer algebra systems are described. Features of such systems and information on MACSYMA, Maple, muMath, REDUCE, and SMP are given. (MNS)

Five guidelines for enhancing the value of a computer graphics program are described and illustrated. Using a well-structured program, correct scaling, normalized device coordinates, word coordinates, and illusions are discussed. (MNS)

A printout is presented from a database that contains information about microcomputer software which supports instruction in college mathematics. The listing is arranged alphabetically by course; source and price are indicated, with a list of publishers included. (MNS)

A program for drawing a line segment is developed. (MNS)

The Geometric Supposer computer software is described. It allows users to make any geometric construction that Euclid knew how to make. Some explorations with the Supposer are presented. (MNS)

An efficient division algorithm is developed, using a computer program, to convert any positive fraction to its decimal representation. The computer program listing is included. (MNS)

Describes the algorithm used to select a simple random sample of certain size without having to list all possible samples and a justification based on Pascal's triangle. Provides testing results by various computers. (YP)

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)

Describes a number sequence made by counting the occurrence of each digit from 9 to 0, catenating this count with the digit, and joining these numeric strings to form a new term. Presents a computer-aided proof and an analytic proof of the sequence; compares these two methods of proof. (YP)