geometry-topology / Discrete Geometry, Packing

Erdős Problem #106

If $f(n)$ is the maximum total side length of $n$ interior-disjoint squares packed in the unit square, is $f(k^2 + 1) = k$? An exact rational configuration packs $17$ squares with total side length greater than $4$, refuting the identity at $k = 4$.

11Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

geometry-topologyJul 29, 2026Significance 11/100Registry: lean verified

Erdős Problem #106

Prior state unknowndisproved

If $f(n)$ is the maximum total side length of $n$ interior-disjoint squares packed in the unit square, is $f(k^2 + 1) = k$? An exact rational configuration packs $17$ squares with total side length greater than $4$, refuting the identity at $k = 4$.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

If $f(n)$ is the maximum total side length of $n$ interior-disjoint squares packed in the unit square, is $f(k^2 + 1) = k$? An exact rational configuration packs $17$ squares with total side length greater than $4$, refuting the identity at $k = 4$.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.