benchmarks.wiki / Public workspace

Omni-MATH / Let ABCDEF be a regular hexagon and let point O be the center of the hexagon. How many ways can you color these seven points either red or blue such that there doesn't exist any eq…

Problem

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

problem

Let ABCDEFABCDEF be a regular hexagon and let point OO be the center of the hexagon. How many ways can you color these seven points either red or blue such that there doesn't exist any equilateral triangle with vertices of all the same color?
Plain-text mathematical notation (without MathML)
Let ABCDEF be a regular hexagon and let point O be the center of the hexagon. How many ways can you color these seven points either red or blue such that there doesn't exist any equilateral triangle with vertices of all the same color?
Original LaTeX notation
Let \(ABCDEF\) be a regular hexagon and let point \(O\) be the center of the hexagon. How many ways can you color these seven points either red or blue such that there doesn't exist any equilateral triangle with vertices of all the same color?

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