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

Key:

- Free Content

- New Content

- Subscribed Content

- Free Trial Content

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: 10.4169/193009709X469797

Free content The full text is free.

View now: