Abstract
Various sequences of polygons are described and the radii are determined when each successive member of the sequence is the largest next member of the sequence containing its predecessor, or else the smallest next member of the sequence containing its predecessor. In particular, a correct solution of the problem of finding the area of the circle that is the limit of the largest regularn-gon fitting inside a regular (n−1)-gon, starting from an equilateral triangle of unit area, is found to be 0.0753105.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Voorhees, B. H.,Problem No. 6062, American Mathematical Monthly, Vol. 82, p. 106, 1975.
Schmeichel, E. F., andPierce, J. G.,Nesting Regular n-gons, American Mathematical Monthly, Vol. 84, p. 578, 1977.
Troesch, B. A.,Optimization of Nested Polygons, Journal of Optimization Theory and Applications, Vol. 31, pp. 7–16, 1980.
Author information
Authors and Affiliations
Additional information
Communicated by S. M. Roberts
This work was done in part while the author was visiting the Mathematical Institute, Oxford University, Oxford, England, assisted there by the Science and Engineering Research Council.
Rights and permissions
About this article
Cite this article
Daley, D.J. Optimally nested regularN-gons. J Optim Theory Appl 41, 425–437 (1983). https://doi.org/10.1007/BF00935362
Issue Date:
DOI: https://doi.org/10.1007/BF00935362