HMMT November 2016 U24
- Guts
- Answer
Consider an infinite grid of equilateral triangles. Each edge (that is, each side of a small triangle) is colored one of colors. The coloring is done in such a way that any path between any two nonadjecent vertices consists of edges with at least two different colors. What is the smallest possible value of ?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
6
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.