Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

How would you go about calculating the number of permutations in ascending order.

Obviously if you had (a set of) 3 numbers you have $ 3! $ permutations:

(1,2,3), (1,3,2), (2,1,3), (2,3,1), (3,1,2), and (3,2,1)

But only one of these is in ascending order (1,2,3).

Consider the lottery - picking 6 numbers from 49. Normally the order for this doesn't matter you just calculate '49 choose 6' but if the numbers have to be in ascending order how would you calculate that?

share|improve this question

2 Answers 2

up vote 4 down vote accepted

In the same way: The number of (strictly) ascending sequences of $6$ numbers chosen from $49$ is $\binom{49}{6}$. For as you have pointed out, once the $6$ numbers have been chosen, there is precisely one way to arrange them in ascending order.

share|improve this answer

Hint: A combination is a permutation where order does not matter.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.