benchmarks.wiki / Public workspace

Omni-MATH / Let P be a convex n polygon each of which sides and diagnoals is colored with one of n distinct colors. For which n does: there exists a coloring method such that for any three of …

Problem

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

problem

Let P P be a convex n n polygon each of which sides and diagnoals is colored with one of n n distinct colors. For which n n does: there exists a coloring method such that for any three of n n colors, we can always find one triangle whose vertices is of P P' and whose sides is colored by the three colors respectively.
Plain-text mathematical notation (without MathML)
Let P be a convex n polygon each of which sides and diagnoals is colored with one of n distinct colors. For which n does: there exists a coloring method such that for any three of n colors, we can always find one triangle whose vertices is of P' and whose sides is colored by the three colors respectively.
Original LaTeX notation
Let $ P$ be a convex $ n$ polygon each of which sides and diagnoals is colored with one of $ n$ distinct colors. For which $ n$ does: there exists a coloring method such that for any three of $ n$ colors, we can always find one triangle whose vertices is of $ P$' and whose sides is colored by the three colors respectively.

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. 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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import