benchmarks.wiki / Public workspace

Omni-MATH / Consider an infinite grid of equilateral triangles. Each edge (that is, each…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Consider an infinite grid of equilateral triangles. Each edge (that is, each side of a small triangle) is colored one of NN colors. The coloring is done in such a way that any path between any two nonadjacent vertices consists of edges with at least two different colors. What is the smallest possible value of NN?
Plain-text mathematical notation (without MathML)
Consider an infinite grid of equilateral triangles. Each edge (that is, each side of a small triangle) is colored one of N colors. The coloring is done in such a way that any path between any two nonadjacent vertices consists of edges with at least two different colors. What is the smallest possible value of N?
Original LaTeX notation
Consider an infinite grid of equilateral triangles. Each edge (that is, each side of a small triangle) is colored one of $N$ colors. The coloring is done in such a way that any path between any two nonadjacent vertices consists of edges with at least two different colors. What is the smallest possible value of $N$?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import