The necessary bound of rectangle’s square for packing into this any system of five and more than five finite quantity squares with total area 1

Citations Over Time

Abstract

It is proved in this paper that any preassigned system of five and more than five finite quantity squares with total area 1 may be packed in parallel into a rectangle whose area is at least Sd =(2 + 31/2)/3.

Related Papers

• → The necessary bound of rectangle’s square for packing into this any system of five and more than five finite quantity squares with total area 1(2017)2 cited
• → A square from similar rectangles(2013)
• → To transform a rectangle into a square(1885)
• → Putting an Old Puzzle to Work(1981)
• → XII.—Professor Kelland's Problem on Superposition(1892)