Jump to content

Talk:Square packing

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

It would be cool to have the images for the first numbers, from 1 to 10. I know how n= 1, 4, and 9 looks, but cannot imagine how 3 or 7 look. — Preceding unsigned comment added by 69.94.46.129 (talk) 09:06, 21 February 2023 (UTC)[reply]

Why is there a a table on the Square packing in a square for circle packing in a square, but not for square packing in a square? — Preceding unsigned comment added by 108.24.78.18 (talk) 14:40, 22 February 2023 (UTC)[reply]

Sequence for identifying the non-aligned cases

[edit]

It appears to me that the numbers where (sequence A189151 in the OEIS) may give the values where packed unit squares in the shortest side square are not orthogonal. Jason Quinn (talk) 08:53, 4 June 2023 (UTC)[reply]

Problem description

[edit]

The articles describes the problem as being to pack as many quares into a given larger form. Actually it seems to be rather the other way round: How small can the larger form be to pack n squares into it?

This is the way Packing_problems#Packing_of_squares describes it too.

I suggest to adjust the description or at least add an alternative version. Meillo (talk) 12:31, 12 February 2024 (UTC)[reply]

These two questions are the same, in the sense that the complete answer to one can be easily translated to give the complete answer to the other. --JBL (talk) 23:55, 13 February 2024 (UTC)[reply]