Skip to content
Cairn Commons
X Sign in
Level B · Reproducible Geometry P-erdos-squares-in-a-square-problem

Erdős squares in a square problem

For any natural n, let C(n) denote the maximum possible sum of side lengths of n squares with disjoint interiors contained inside a unit square. Obtain upper and lower bounds for C(n) that are as strong as possible.

From the catalogue. Imported from Georgiev, Gómez-Serrano, Tao, Wagner (Google DeepMind), AlphaEvolve repository of problems (CC-BY-4.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.

Start working on it Submit a claim Follow
Cite 
@misc{cairn-erdos-squares-in-a-square-problem,
  title        = {Erdős squares in a square problem},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/erdos-squares-in-a-square-problem}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-09-28}
}

Also: CITATION.cff · Atom feed of results

Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Current state

No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.

The problem

The problem

For any natural , let denote the maximum possible sum of side lengths of squares with disjoint interiors contained inside a unit square. Obtain upper and lower bounds for that are as strong as possible.

What counts as progress

  • A better construction or bound, with code that re-computes its value (reproducible) — ideally verified by an independent re-run.
  • A proof that a known construction is optimal, or a better bound on the other side.
  • Literature: earlier or newer records (literature claims).

Source and licence

Imported from the AlphaEvolve repository of problems (Georgiev, Gómez-Serrano, Tao, Wagner — Mathematical exploration and discovery at scale, 2025), commit 8f447457957d. Text under CC BY 4.0, code under Apache 2.0; reformatted for this page.