Art of Problem Solving

Mock AIME 3 Pre 2005 Problems/Problem 2: Difference between revisions

1=2 (talk | contribs)
red the problem wrong, I thought it was talking about the answer. :embarrased:
1=2 (talk | contribs)
Line 6: Line 6:


==See also==
==See also==
{{Mock AIME box|year=Pre 2005|n=3|num-b=1|num-a=3}}


[[Category:Intermediate Combinatorics Problems]]
[[Category:Intermediate Combinatorics Problems]]

Revision as of 18:50, 19 June 2008

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

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

See also

Mock AIME 3 Pre 2005 (Problems, Source)
Preceded by
Problem 1
Followed by
Problem 3
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15