IR-MO 2006 Problem 7
We have finite number of distinct shapes in plane. A "convex Kearting" of these shapes is covering plane with convex sets, that each set consists exactly one of the shapes, and sets intersect at most in border.
In which case Convex kearting is possible?
- Finite distinct points
- Finite distinct segments
- Finite distinct circles
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.