Borsuk's problem on upper and lower bounds for the number of smaller-diameter subsets needed to cover a bounded n-dimensional set.

Open the “Covering and packing” section on Wikipedia →

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