Find the least number A such that for any two squares of combined area 1, a rectangle of area A exists such that the two squares can be packed in the rectangle (without interior
overlap).
You may assume that the sides of the squares are parallel to the sides of the
rectangle.
(In reply to
re(2): Second attempt by Brian Smith)
Ah I see. Rather than looking for a specific rectangle, you are looking for a specific numerical area. Then for that area, some rectangle exists for any pair of squares.
Very carefully reading the problem, I think this is actually a better interpretation. (And a more interesting result.)
|
|
Posted by Jer
on 2024-04-02 13:46:56 |
re(3): Second attempt
