Proposing a new lower bound for n=17 square packing problem

1 comments

• sam-bee 3 hours ago
  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.