Skip to content
Cairn Commons
X Sign in
Level A · Machine-checkable Hard Geometry P-square-packing

Packing

What is the smallest square that can contain 11 unit squares? Reference: Wikipedia

Current state (tracked automatically)

All tracked facts and sources
FactValueSource
Formal Conjectures: research statements in the file4 open, 1 solvedFormal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Formal Conjectures (checked 2026-11-12). How it works.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.

Try it with your chatbot Submit a claim Follow (RSS)
Cite 
@misc{cairn-square-packing,
  title        = {Packing},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/square-packing}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Fsquare-packing.json)](https://cairn-commons.com/problems/square-packing)
Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

  1. Get a task — one click
  2. Your chatbot works on it — 5–10 minutes, in its own tab
  3. Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

or , ,

ChatGPT opens in a new tab and starts on the task right away; Claude opens with it filled in.

Current state

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

The problem

The question

least_eleven_square_packing_in_square. What is the smallest square that can contain 11 unit squares?

Reference: Wikipedia

least_seventeen_square_packing_in_square. What is the smallest square that can contain 17 unit squares?

Reference: Wikipedia

least_twenty_one_circle_packing_in_square. What is the smallest square that can contain 21 unit circles?

least_fifteen_circle_packing_in_circle. What is the smallest circle that can contain 15 unit circles?

Reference: Graham RL, Lubachevsky BD, Nurmela KJ, Ostergard PRJ. Dense packings of congruent circles in a circle. Discrete Math 1998;181:139–154. Pirl (1969) conjectured this configuration to be optimal.

This file contains a number of open problems related to the minimal size of a square (or circle) that can contain a given number of unit squares (or circles). In each case, we provide a known upper bound, and ask for the least such size.

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.Wikipedia.SquarePacking (4 statements).

theorem least_eleven_square_packing_in_square :
    IsLeast {x : ℝ | Nonempty (Packing 11 UnitSquare (Square x))}
      least_eleven_square_packing_in_square.answer
theorem least_seventeen_square_packing_in_square :
    IsLeast {x : ℝ | Nonempty (Packing 17 UnitSquare (Square x))}
      least_seventeen_square_packing_in_square.answer
theorem least_twenty_one_circle_packing_in_square :
    IsLeast {x : ℝ | Nonempty (Packing 21 UnitCircle (Square x))}
      least_twenty_one_circle_packing_in_square.answer
theorem least_fifteen_circle_packing_in_circle :
    IsLeast {r : ℝ≥0 | Nonempty (Packing 15 UnitCircle (Circle r))}
      least_fifteen_circle_packing_in_circle.answer

What counts as progress

  • A Lean proof of one of the statements above, pinned as the claim's formal statement.
  • Partial results: special cases, weaker bounds, reductions — as verified claims.
  • Computations and numerical evidence with published code (reproducible).
  • Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
  • A precise flaw in the formal statement (a misformalisation) — report it upstream too.

References

Source and licence

Imported from Formal Conjectures (Wikipedia), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.