2 points | by sam-bee 10 hours ago
1 comments
The n=17 square packing problem is the challenge of fitting 17 unit squares into the smallest possible square container.
This post proposes a new lower bound of 4.4811 on the size of the container.
The proof was written by GPT 5.6 Sol.
The n=17 square packing problem is the challenge of fitting 17 unit squares into the smallest possible square container.
This post proposes a new lower bound of 4.4811 on the size of the container.
The proof was written by GPT 5.6 Sol.