We colored vertices of a hexagon convex ABCDEF 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 top of this hexagon colored such that any two neighboring points have distinct colors.

## Comments

Sort by:

TopNewestThe answer was 24 . – Omar Sehlouli · 7 months ago

Log in to reply