Skip to content

Erdős problem 106

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

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:f29992c10e55801f1885b577ad06ec9c15325bf0666b4161a5d74a7eae321797
Metadata
sha256:eb7403d54f71521180f89746e985dfd5612163b14ab2c9a605ebfda528a57edb
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:73a7fc248fd6aa908b4c80e51d14d8899c38473f5794f0fc29718edfd78c1254
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb