Book 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.

Book 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.

#books  #math  
∞  08/16/10
165 notes
  1. syazwimazli reblogged this from fuckyeahmath and added:
    that is true. interesting.
  2. 3rdplanet reblogged this from fuckyeahmath
  3. marioisgay reblogged this from fuckyeahmath
  4. cami-woodhouse reblogged this from fuckyeahmath and added:
    Book Stacking Problem How far can a stack of n books protrude over the edge of a table without the stack falling over?...
  5. thehiso reblogged this from 2arrs2ells
  6. smtwtfs reblogged this from proofmathisbeautiful
  7. scienceislove reblogged this from proofmathisbeautiful
  8. justvhanj reblogged this from proofmathisbeautiful
  9. bparramosqueda reblogged this from proofmathisbeautiful
  10. christinagewerth reblogged this from proofmathisbeautiful
  11. livelyjanssen reblogged this from proofmathisbeautiful
  12. 1544ad reblogged this from proofmathisbeautiful
  13. diariesofforeignlovers reblogged this from proofmathisbeautiful and added:
    I might try this
  14. pozzvino8 reblogged this from proofmathisbeautiful
  15. knutiscute reblogged this from proofmathisbeautiful