The covering problem of Rado

if the union of finitely many axis-parallel squares has unit area, how small can the largest area covered by a disjoint subset of squares be?

Open the “Covering and packing” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)