Photo reblogged from 2arrs, 2ells with 165 notes
viaBook Stacking Problem
How far can a stack of n books protrude over the edge of a table without the stack falling over? It turns out that the maximum overhang possible dn for n books (in terms of book lengths) is half the nth partial sum of the harmonic series.
Source: fuckyeahmath
that is true. interesting.
Book Stacking Problem How far can a stack of n books protrude over the edge of a table without the stack falling over?...
I might try this