Putnam 1962 B4
- Session B
The euclidean plane is divided into regions by drawing a finite number of circles. Show that it is possible to color each of these regions either red or blue in such a way that no two adjacent regions have the same color.
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.