Forty-four unit squares need a square of side seven.

Let s(n) be the side of the smallest square into which n unit squares with pairwise disjoint interiors can be packed, rotations allowed. We prove s(44) = 7. The proof is a weighted closed cover of [0, 7]2: an explicit measure made of 15,525 weighted points and 3,912 uniformly weighted pieces of the interior grid lines, of total mass 2199755099/50000000 < 44, such that every closed unit square in [0, 7]2 has mass at least one. The covering property is verified by two independently written exact rational-arithmetic checkers, one of them both with and without symmetry reduction. The certificate has only 0.4% of slack, and finding it required a new separation step for low-mass “valleys” formed by nearly axis-parallel squares resting on the walls. We describe that step because the same obstruction should appear in other cases with a thin margin.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-29
DOI
https://doi.org/10.5281/zenodo.23769765
Primary Topic
Optimization and Packing Problems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Forty-four unit squares need a square of side seven.

Sara Gharabaghi, Mohsen Khalili
2 links
Zenodo (CERN European Organization for Nuclear Research)
Optimization and Packing Problems
preprint

Forty-four unit squares need a square of side seven.

Sara Gharabaghi, Mohsen Khalili
preprint en

Abstract

Let s(n) be the side of the smallest square into which n unit squares with pairwise disjoint interiors can be packed, rotations allowed. We prove s(44) = 7. The proof is a weighted closed cover of [0, 7]2: an explicit measure made of 15,525 weighted points and 3,912 uniformly weighted pieces of the interior grid lines, of total mass 2199755099/50000000 < 44, such that every closed unit square in [0, 7]2 has mass at least one. The covering property is verified by two independently written exact rational-arithmetic checkers, one of them both with and without symmetry reduction. The certificate has only 0.4% of slack, and finding it required a new separation step for low-mass “valleys” formed by nearly axis-parallel squares resting on the walls. We describe that step because the same obstruction should appear in other cases with a thin margin.

Zenodo (CERN European Organization for Nuclear Research)
Optimization and Packing Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon