MAA Writing Awards
Award: Lester R. Ford
Year of Award: 2010
Publication Information: The American Mathematical Monthly, vol. 116, no. 1, January 2009, pp. 19-44.
Summary: The problem of how far off the edge of a table one can reach by stacking n identical, friction free, blocks of unit length first appeared in the Monthly in 1923 and has been considered elsewhere many times. Conventional wisdom says that the optimal solution is asymptotic to log (n)/2 as n increases, and is obtained by the harmonic stacking. This result is correct under the implicit added hypothesis that each block can rest on only one block below it. The authors investigate this problem without the one-on-one restriction.
About the Authors: (From the Prizes and Awards booklet, MathFest 2010)
Uri Zwick is a professor of Computer Science at Tel Aviv University, Israel. He received his BSc in Computer Science from the Technion, Israel Institute of Technology, and his MSc and PhD in Computer Science from Tel Aviv University. His main research interests are: algorithms and complexity, combinatorial optimization, mathematical games, and recreational mathematics. Zwick spent two years as a PostDoc at Warwick University after completing his PhD and has been collaborating with Mike Paterson ever since.