You are here

CMJ Contents: September 1998

The College Mathematics Journal

Contents for September 1998


How to Pump a Swing
Stephen Wirkus, Richard Rand, and Andy Ruina

Pumping a swing from a standing position amounts to increasing the amplitude of a pendulum by modifying its length in a systematic way. Pumping from a seated position, however, involves a sudden rotation of the rider's body when the swing momentarily comes to a stop, which lifts the rider slightly above the previously highest level. Both of these standard pumping strategies are modeled with second-order autonomous differential equations, and qualitative analysis reveals that seated pumping adds a fixed quantity to the amplitude per swing cycle, while standing pumping multiplies the amplitude by a fixed factor greater than 1. Thus, for small amplitudes seated pumping gives a greater increase in amplitude per cycle but at larger amplitudes standing pumping is more efficient. The authors propose a new strategy for pumping from a seated position that promises a geometric increase in amplitude like standing pumping.

The Fundamental Theorem of Algebra
Michael D. Hirschhorn

Given a polynomial p(z) , consider the surface S above the complex plane given in parametric form by (x,y,t)= (Re{p(Reiq)}, Im{p(Reiq)},R),0 £ R , 0 £ q £ 2p. In general, S is a cone-like surface rising from the point p(0) = (re{p(0)}, Im{P(0)}), whose cross-section at height R is the image of the circle |z| = R under the mapping zÃ? p(z). Thus these cross-sections are closed curves that up high wind around the vertical axis n times, where n = deg(p(z)), and down low they remain near p(0) and hence do not reach the vertical axis. Since the surface is continuous, there must be some points z =Reiq at which the surface intersects the vertical axis, and there p(z) = 0. The proof is illustrated with the plot of the cone S for a sample polynomial.

How Much Money Do You (or Your Parents) Need for Retirement?
James W. Daniel

This introduction to actuarial science considers the fundamental question: For a given yearly rate of return, how much do retirees need to have invested now in order to provide $1 at the start of each year from their date of retirement as long as they live? Employing mortality tables, a satisfactory is found for a large group of retirees of a given age and gender. However, for an individual to have a given confidence level of not running out of money during his or her lifetime, a much larger initial investment is needed because many will live longer than the average survival time for the group. A statistical argument shows how by pooling their risks individuals can greatly reduce the investment needed to achieve a given level of confidence that they will not run out of money during their retirement years.

Making Squares from Pythagorean Triangles
Charles Jepsen and Roc Yang

In this report on an undergraduate research project, the authors show a square exists that can be dissected into m Pythagorean triangles (right triangles with integer sides) if and only if m£ 5. This is shown by displaying a square that can be dissected into five Pythagorean triangles, and observing that a dissection into m triangles implies a dissection of a (usually larger) square into m+ 1 squares. It then remains to be shown that no square can be dissected into 2, 3 or 4 Pythagorean triangles. The existence of such a dissection in the case m= 4 would imply the existence of a rational point (x,y) with x> 4 on a certain elliptic curve, and algebraic geometers have shown that the curve has no such rational points.

On Factoring with the b-algorithm
Vincent Lucarelli

An algorithm suggested by Fermat can be used to factor integers n that are the product of two nearly equal factors. Here a more efficent algorithm is proposed for factoring such special numbers, and it is shown to be more efficient than the Fermat method. The key step in the algorithm is to search for integers b of a certain parity that make an expression assume an integer value, where the parity of b and the values of the integer parameters p, q, are easily computed directly from n. When such a value of n is found, the factorization of n follows at once. This special algorithm implies that the modulus chosen for implementing the RSA encryption algorithm should not be a product of two nearly equal factors.

Egyptian Fractions and the Inheritance Problem
Premchand Anne

The inheritance problem (W. Frederick and J. Hersberger, The mathematical judge: A fable, CMJ 26:5 (1995) 377-381) is closely related to the ancient problem of completing a given sum of "Egyptian fractions" (fractions with unit denominator), with other such fractions to make the sum equal 1. A special case of particular interest is when the final Egyptian fraction is required to be the product of all the others:Ã?(1/ni) + 1/(P ni) =1. The solutions with 7 or fewer ni are known, but few general results are known for solutions of length greater than 7. This note surveys the known results and the current status of related conjectures.


Classroom Capsules

Michael A. Carchidi, Generating Exotic-Looking Vector Spaces
Given a one-to-one function f from the real numbers onto a set V, if we define vector addition in V by and similarly define multiplication of elements of V, by real numbers, then inherits the structure of a one dimensional vector space over the real numbers. Examples show how this construction, together with direct sums, can produce exotic-looking vector spaces in which it is easy to create challenging problems involving the concepts of basis sets, coordinate vectors, inner products, and linear transformations. An application to special relativity shows how these unusual vector spaces can be useful.

Norton Starr, Nothing Counts for Something
Students often overlook the empty set of the vacuous state in counting problems. A good example is the problem of counting the number of possible lighting levels that can be produced by a floor lamp with a central bulb that can shine with say 50, 100 or 150 watts, and three 60 watt bulbs controlled by a second switch so that any number of them can be on simultaneously. The most common student response is 9 possible illumination levels, but once their mistake is pointed out they recognize that the off position for each switch is just as important a state to consider as any of the others.

Yukio Kobayashi, A Geometric View of a Vector Identity
The vector identity is usually proved by algebraic methods. However, by using a basis for 3-space that is adapted to the problem, a simple geometric proof is given.

Bob Palais, An Example Demonstrating the Fundamental Theorem of Calculus
By appealing to the area formulas for triangles and sectors of a circle, one can show directly (using implicit differentiation) that if A(t) is the area under the graph of the function f(x) = ÷1 - x2 for -1 £ x £ t , then A' (t) = f(t) . Such a calculation in a specific case sets the stage for the general proof of the fundamental theorem of calculus.

Sidney H. Kung, More Coconuts
Another solution is given to the linear Diophantine problem of dividing a pile of coconuts, discussed in a recent article: S. Singh and D. Bhattacharya, On Dividing Coconuts, CMJ 28:3 (1997) 203-204.


Computer Corner

Larry Riddle, Arc Length Contest
To enliven the discussion of arc length, calculus students are challenged to find three examples of continuous nonnegative functions on the unit interval whose values at both endpoints are zero, each with a unit area bounded by the x-axis, the graph of the function, and the lines x= 0 and x=1 . The winner of the contest is the student who submits the function with the smallest arc length on the unit interval. (The requirement that the bounding curve be the graph of a continuous function with value 0 at both endpoints excludes the possibility of two vertical segments surmounted by a semicircle.) Student entries in the contest, created by combining elementary functions, are discussed.

Van Bain, An Algorithm for Drawing the n-cube
The n-cube is a graph with 2n vertices labeled 0, 1, 2, ... 2n such that when the labels are expressed in binary form, an edge connects each pair of vertices that differ by exactly one binary digit. A simple recursive algorithm for drawing the n-cube with its vertices equally spaced around the unit circle, and labeling the edges, is presented. This depiction of the n-cube makes apparent several properties of this important graph.


Software Review

Mathematica, Version 3.0 is a major update of a leading computer algebra system. Besides enhancing several commands available in earlier versions, it introduces a new system for entering mathematical expressions in standard symbolic form and it expresses results in this form. This review, by Steven Wilkinson, shows the new user interface in action on some calculus problems, and discusses some problems teachers may encounter in adapting to this comprehensive interactive system for doing mathematics.

Dummy View - NOT TO BE DELETED