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.

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)

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)

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)

This article develops an algorithm to find all solutions to the problem, making all sums of a hexagram's nine lines the same. It shows how to exploit the geometric structure of the hexagram and its group of automorphisms. (YP)

Described are several programs that enable the user to evaluate derivatives to order n of any elementary function by using the combination of automatic differentiation method and A Programming Language (APL). Programs calculating first- and higher-order derivatives are presented. Selected APL symbols are appended. (YP)

Implements a table algorithm on a spreadsheet program and obtains functions for several number sequences such as the Fibonacci and Catalan numbers. Considers other applications of the table algorithm to integers represented in various number bases. (YP)