Overhang
Authors: Paterson, Mike; Zwick, Uri
Source: American Mathematical Monthly, Volume 116, Number 1, January 2009 , pp. 19-44(26)
Publisher: Mathematical Association of America
Abstract:
How far off the edge of a table can we reach by stacking n identical, homogeneous, frictionless blocks? A classical solution achieving a logarithmic overhang was widely believed to be optimal. We show, however, that this classical solution is exponentially far from optimality.Document Type: Research article
DOI: http://dx.doi.org/10.4169/193009709X469797
Publication date: 2009-01-01
- American Mathematical Monthly publishes articles, notes, and other features about mathematics and the profession. AMM readers span a broad spectrum of mathematical interests, and include professional mathematicians as well as students of mathematics at all collegiate levels.
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Membership Information
- Information for Advertisers
- Terms & Conditions
- MAA Bookstore
- Loci
- Math Horizons
- ingentaconnect is not responsible for the content or availability of external websites
- In this: publication
- By this: publisher
- In this Subject: Mathematics and Statistics , Education
- By this author: Paterson, Mike ; Zwick, Uri

Shopping cart
Receive new issue alert
Get Permissions