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 … · Discussion
Discussing 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 … · Omni-MATH
Posts
Chronological order within this page.
State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.