Question 473365
How many increasing permutation of m symbols are there from the set of n numbers{a1,a2,...,an} where the order among the numbers is given by a1 < a2 < a3... < an?
<pre>
We can choose m of of the n terms in C(n,m) ways.

That's the combinations of n things taken m at a time, sometimes
written <sub>n</sub>C<sub>m</sub> of {{{(matrix(2,1,n,m))}}} and the
formula for it is {{{n!/(m!(n-m)!)}}}.

Edwin</pre>