Unsolved problem in mathematics
What is the arrangements of squares with parallel edges which has the smallest area-maximizing subset of squares in which the squares in the subset do not overlap?
The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares. It was formulated in 1928 by Tibor Radó and has been generalized to more general shapes and higher dimensions by Richard Rado.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search