3 problems
Polynomial plank conjecture. There exists a point such that, for every , the distance from to the zero set of is at least .
Smurov's conjecture. The planks can be translated so that their translates cover .
Smurov's conjecture. There exists a constant , possibly depending on , such that any collection of planks in with total width at least can be translated…