All Questions
2
questions
0
votes
1
answer
100
views
Understanding a proof on IMO shortlist 2016 C3
The problem goes as follow:
Let $n$ be a positive integer relatively prime to 6. We paint the vertices of a regular
$n$-gon with three colours so that there is an odd number of vertices of each colour....
- 800
2
votes
1
answer
3k
views
Coloring the 6 vertices of a regular hexagon with a limited use per color
I want to solve to following two-part problem. I solved the first part but I am not sure how to start on part B.
A) How many ways are there to color the 6 vertices of a regular hexagon using 4 colors ...
- 43