Article contents
A symmetrical pursuit problem on the sphere and thehyperbolic plane
Published online by Cambridge University Press: 01 August 2016
Extract
The following is a well known pursuit problem: n bugs are at rest at the vertices of a regular polygon. At a certain instant each bug starts crawling towards its neighbour on the right with a constant speed, always altering its course so as to be headed directly towards its neighbour. How long does it take for the bugs to meet at the center of the polygon and what paths do they trace out in getting there? The earliest reference I could find to this problem was in a collection of mathematical puzzles edited by L.A.Graham. A more recent reference to it occurs in the amusing and informative collection of geometrical curiosities by David Wells. The “n-bug” problem was also discussed briefly in two of Martin Gardner’s columns in Scientific American. The cover of the July 65 issue of that magazine shows the equiangular spirals traced out by four bugs as they “square dance” their way towards their tryst at the centre.
- Type
- Research Article
- Information
- Copyright
- Copyright © The Mathematical Association 1994
References
- 3
- Cited by