Researchers establish minimal string wraps for multi-nail picture-hanging problem

The short version

• Tom Verhoeff and Jens Heuseveldt determined that 16 wraps is the absolute minimum configuration needed to solve the 2-out-of-4 picture-hanging problem.[Scientific American]
• The finding significantly lowers the previously known 80-wrap solution, with broader results posted as preprints on arXiv.org.[Scientific American]
• While formulated as a recreational riddle, the mechanics of picture-hanging problems connect directly to group theory, knot theory, and monotone Boolean functions.[Scientific American]

Key facts

• A riddle originally proposed in 1997 asked if a painting could be hung across two nails such that pulling either nail causes it to fall.[Scientific American]
• Mathematicians proved in a 2012 preprint that generalized solutions exist for any configuration where removing k out of n nails drops the painting.[Scientific American]
• Tom Verhoeff and Jens Heuseveldt verified with a computer program that the absolute minimum solution for the 2-out-of-4 nail problem is 16 wraps.[Scientific American]
• Verhoeff released the findings alongside explicit solutions for families of hanging problems on the arXiv.org preprint archive.[Scientific American]
• The mechanics governing valid picture-hanging rules correspond directly to monotone Boolean functions, which have applications in cryptography and voting theory.[Scientific American]

Sources

Outlet counts describe coverage, not independent confirmation. Reports may share a wire service or original source.

• Mathematicians discover the worst way to hang a paintingScientific American metered