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: Second attempt by Jer)
I agree with Larry's second attempt. We are not looking for a specific rectangle. We are looking to show for any pair of squares there is a rectangle with a specified area: "a rectangle of area A". I note the use of the indefinite article "a" instead of definite article "the" to mean that the rectangle is not a very specific one.
And then what is the smallest value of A? It is simply the largest of the tight bounding rectangles' areas.
re(2): Second attempt
