Possible Duplicate:
How to reverse the $n$ choose $k$ formula?
Recently saw an ad for a salad bar in Spain offering 1000 different combinations. Now, this could be a salad containing three parts, with a choice of ten ingredients for each part, but this was probably just an advertisement effort. There is one more (unlikely) option that I found interesting:
The salad bar could potentially have $n$ ingredients, from which you could choose only $m$, if the following condition held:
$${m \choose n } = \frac{n!}{m!(n-m)!} = 1000$$
And more generally, for a given $N$, do there exist $m,n$ such that: $${m \choose n } = N$$ Is there a general method of finding such a pair? is such a pair unique?