Community Cracks Minimal Square Packing for N Squares with Visual Proof
ctjlewis · x · 2026-10-07
X users collaboratively worked on the classic square packing problem — finding the smallest container square that fits N unit squares and its densest configuration. ctjlewis explained the setup (shrinking the container until N squares barely fit), while @ojoshe is writing a human-readable proof, with a visual proof by Josh shared via link.
Related event: Optimality of 11-Square Packing Proven and Formalized in Lean(10 posts)→
More from Fun
- Parody 'breaking': OpenAI to launch its own math journal with 100 inaugural papers — _onionesque · 2026-10-07
- 'I've had enough of graphical processor unitarians': a GPU pun — sloppenheimer · 2026-10-07
- "Remember when fixing bugs required thinking?" engineer quips on AI coding — KevinNaughtonJr · 2026-10-07
- Codex-built Blink 2: an interactive flight sim with a real software depth buffer — MikePFrank · 2026-10-07
- Cryptography: turning every problem into a key management problem since 1400 BC — matthew_d_green · 2026-10-07
- Startup culture now requires posting about working hard, not just working — vhanagwal · 2026-10-07