by Herb Bailey and Dan Kalman
This article originally appeared in:
College Mathematics Journal
November, 2011
Subject classification(s):
Calculus | Single Variable Calculus | Continuity | DifferentiationApplicable Course(s):
3.1 Mainstream Calculus IFay and Sam go for a walk. Sam walks along the left side of the street while Fay, who walks faster, starts with Sam but walks to a point on the right side of the street and then returns to meet Sam to complete one segment of their journey. The authors determine Fay’s optimal path minimizing segment length, and thus maximizing the number of times they meet during the walk. Two solutions are given: one uses derivatives; the other uses only continuity.
A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.
To open this file please click here.
Capsule Course Topic(s):
One-Variable Calculus | Differentiation: General Applications