Mock AIME 3 Pre 2005 Problems/Problem 5

Revision as of 08:34, 14 February 2008 by 1=2 (talk | contribs)

Problem

In Zuminglish, all words consist only of the letters $M, O,$ and $P$. As in English, $O$ is said to be a vowel and $M$ and $P$ are consonants. A string of $M's, O's,$ and $P's$ is a word in Zuminglish if and only if between any two $O's$ there appear at least two consonants. Let $N$ denote the number of $10$-letter Zuminglish words. Determine the remainder obtained when $N$ is divided by $1000$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also