Find the number of permutations of { 1 , 2 , 3 , … , 9 } such that 1 comes before 2, 3 comes before 4, and 5 comes before 6.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Can't we solve this problem by taking multiple cases?
Log in to reply
Yes, of course, but I think this way is easy to understand...
First we select 6 positions out of the 9 positions for the digits 1,2,3,4,5 and 6. This can be done in ( 6 9 ) ways. For each position, there are ( 2 6 ) ways for the 1 comes before 2, there are ( 2 4 ) ways for the 3 comes before 4 and ( 2 2 ) ways for the 5 comes before 6.We can arrange the remaining digits (7,8 and 9) in 3! ways. Thus, there are ( 6 9 ) * ( 2 6 ) * ( 2 4 ) * ( 2 2 ) * 3! =45360 such permutations.
Problem Loading...
Note Loading...
Set Loading...
There are 9 ! possible permutations of { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } :
2.- There are 2 ! ⋅ 2 ! 9 ! possible permutations with 1 coming before 2, and 3 coming before 4. And finally,
3.- There are 2 ! ⋅ 2 ! ⋅ 2 ! 9 ! = 4 5 3 6 0 possible permutations with 1 coming before 2, 3 coming before 4 and 5 coming before 6