Mock AIME 3 Pre 2005 Problems/Problem 2

Revision as of 18:46, 19 June 2008 by 1=2 (talk | contribs) (should I edit the question? N is less than 1000.)

Problem

Let $N$ denote the number of $7$ digit positive integers have the property that their digits are in increasing order. Determine the remainder obtained when $N$ is divided by $1000$. (Repeated digits are allowed.)

Solution

Since the digits must be in increasing order, they must all be non-zero. We choose 7 digits out of 9, and when we do, they have only one order, so we choose them regardless of order, or $\binom{9}{7}=\binom{9}{9-7}=\dfrac{9\cdot 8}{2}=\boxed{036}$.

See also