SOLUTION: 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?
Algebra ->
Permutations
-> SOLUTION: 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?
Log On
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? Answer by Edwin McCravy(20055) (Show Source):
You can put this solution on YOUR website! 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?
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 nCm of and the
formula for it is .
Edwin
