Waste less time on Facebook — follow Brilliant.
×

Hexagon to n-gon

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)

Note by Omar Sehlouli
4 months, 3 weeks ago

No vote yet
1 vote

Comments

There are no comments in this discussion.

×

Problem Loading...

Note Loading...

Set Loading...