This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 1

2016 AIME Problems, 12
The figure below shows a ring made of six small sections which you are to paint on a wall. You have four paint colors available and will paint each of the six sections a solid color. Find the number of ways you can choose to paint each of the six sections if no two adjacent section can be painted with the same color. [asy] size(3cm); draw(unitcircle); draw(scale(0.6)*unitcircle); for(int i = 0; i < 6; ++i){ draw(dir(60*i)--0.6*dir(60*i)); } [/asy]
lotr ogre casework combinatorics expected value graph modeling recurrence relations stars and bars