Archived from the original (PDF) on December 4, 2023.
'Simplifying modelling can mislead students'. The On-Line Encyclopedia of Integer Sequences. 'Sequence A014537 (Number of books required for n book-lengths of overhang in the harmonic book stacking problem.)'. In 2018, Michael Stevens, creator of various YouTube channels including Vsauce and D!NG, uploaded a video where Michael and former MythBusters star Adam Savage, discuss and construct a model of the block-stacking problem using plywood. Hall (2005) discusses this problem, shows that it is robust to nonidealizations such as rounded block corners and finite precision of block placing, and introduces several variants including nonzero friction forces between adjacent blocks. Place N Mike Paterson's method to increase the overhang of 16 blocks of unit width and breadth b to 2 √ 1 + b ² by offsetting the blocks perpendicular to their lengths in a diamond formation Robustness The block-stacking problem is the following puzzle: In statics, the block-stacking problem (sometimes known as The Leaning Tower of Lire ( Johnson 1955), also the book-stacking problem, or a number of other similar terms) is a puzzle concerning the stacking of blocks at the edge of a table. Problem of stacking blocks so they extend as far as possible past their base The first nine blocks in the solution to the single-wide block-stacking problem with the overhangs indicated
