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

2000 Switzerland Team Selection Test, 5

Consider all words of length $n$ consisting of the letters $I,O,M$. How many such words are there, which contain no two consecutive $M$’s?