Lesson plan
Moving sofa problem
In mathematics, the moving sofa problem or sofa problem is a two-dimensional idealization of real-life furniture-moving problems and asks for the rigid two-dimensional shape of the largest area that can be maneuvered through an L-shaped planar region with legs of unit width. The area thus obtained is referred to as the sofa constant. The exact value of the sofa constant is an open problem. The leading solution, by Joseph L. Gerver, has a value of approximately 2.2195. In November 2024, Jineon Baek posted a 119-page arXiv preprint claiming that Gerver's value is optimal, which if true would solve the moving sofa problem.
Article summary
In mathematics, the moving sofa problem or sofa problem is a two-dimensional idealization of real-life furniture-moving problems and asks for the rigid two-dimensional shape of the largest area that can be maneuvered through an L-shaped planar region with legs of unit width. The area thus obtained is referred to as the sofa constant. The exact value of the sofa constant is an open problem. The leading solution, by Joseph L. Gerver, has a value of approximately 2.2195. In November 2024, Jineon Baek posted a 119-page arXiv preprint claiming that Gerver's value is optimal, which if true would solve the moving sofa problem.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.