SMRTR summary
The block stacking problem asks how many blocks are needed for the top block to hang completely beyond a table's edge. Using center of mass calculations, just four identical blocks can achieve this. Each added block shifts the overhang further, following a mathematical pattern based on harmonic series.
SMRTR provides this summary for quick context. The original article belongs to Medium.
Read the original articleThis archive is built from SMRTR newsletter stories. Subscribe for hand-picked stories without the extra noise.
A mind-bending math problem reveals that a stack of blocks can theoretically extend infinitely over a table's edge without falling. The solution involves the harmonic series and...
Two students found an unexpected link between the Fibonacci sequence and the "pick-up sticks problem," a probability puzzle. For n random sticks, the probability that no three can...
Alberto Maspero's office window overlooks Italy's Adriatic Sea, where the famous bora wind sometimes drives waves backward toward open water—only to watch them mysteriously...
The royal gridlock puzzle has stumped mathematicians and strategists alike for months. Four rival queens have divided their island kingdoms into precisely measured domains,...
A centrifuge with n circular slots must be loaded with k test tubes symmetrically to avoid explosion. For n=12, arrangements of 2, 3, 4, and 6 tubes work, while 1 and 11 don't....
A new approach to the mathematical "kissing problem" has improved estimates for sphere packing in dimensions 17-21, the first progress in these dimensions since the 1960s. MIT...