Hadwiger covering conjecture
Can every convex body in n-dimensional space be covered by at most 2^n smaller copies of itself, each only shrunk and shifted, not rotated?
Summary
Hugo Hadwiger put the conjecture on a list of unsolved problems in 1957, though Friedrich Levi had studied it in 1955; it also states that 2^n copies are needed only for parallelepipeds. Levi proved it in the plane, where four smaller copies suffice; it is open even in three dimensions, where 14 copies are known to suffice. It is distinct from Hadwiger’s graph colouring conjecture.
Source
Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.