AUSTRIAN-POLISH 1992 Problem 2
Each point on the boundary of a square has to be colored in one color. Consider all right triangles with the vertices on the boundary of the square. Determine the least number of colors for which there is a coloring such that no such triangle has all its vertices of 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.