We colored vertices of a hexagon convex by three different colors ; such that every color appears exactly only two times in the vertices. Find the number of possibilities in order to get every vertice of this hexagon colored such that any two neighboring points have distinct colors.
The answer must be 4.
Can we generalize the solution to a problem like this? we colored vertices of a n-gon convex by n/2 different colors ; such that every color appears exactly only two times in the vertices . Find the number of possibilities in order to get every vertice of this convex colored such that any two neighboring points have distinct colors.
please post some hints. I don't want actually a full solution.
( I tried to look at the sequence , but I failed)
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.