- #1
Martin Rattigan
- 330
- 3
If the Euclidean plane is partitioned into convex sets each of area A in such a way that each contains exactly one vertex of a unit square lattice and this vertex is in its interior, is it true that A must be at least 1/2?
If not what is the greatest lower bound for A?
The analogous greatest lower bounds for En obviously form a non increasing sequence (ordered by n). What is the value for En?
If not what is the greatest lower bound for A?
The analogous greatest lower bounds for En obviously form a non increasing sequence (ordered by n). What is the value for En?