×

# 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.

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
9 months, 4 weeks ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$