First we need to choose two vowels and then three consonants . Now that we have 5 letters required to make the word,arrange them in 5! ways.
So,
If Jason is on th ecouncil,this reduces the selction pool to only 13 people,out of which we still need to select 4.
So, = 715
The total possible cases would be a 5 card hand with no restrictions : 5
The unwanted cases are:
no queens(out of 48 non-queens cards we get 5)
only 1 queen(out of 4 queens we get 1,and out of 48 non-queens we get 4)
Therefore,
Choose 2 juniors and 2 seniors.
There are seven positions to be filled.
The first position can be filled using any of the 7 letters contained in PROBLEM.
The second position can be filled by the remaining 6 letters as the letters should not repeat.
The third position can be filled by the remaining 5 letters only and so on.
Therefore, the total number of ways of rearranging the 7 letter word = 7*6*5*4*3*2*1 = 7! ways.
There are ways of selecting two men, and ways of selecting a woman.Since each position in the committee is different,arrange the three people in 3! ways.
So,
Since,each member of the league must meet every other member of the league.If they only played each other once,there would be games.Since,each pairing of teams will occur three times,the answer will be triple.
Therfore, =84
This is the number of permutations of five things taken all at a time.
Therefore, answer = = 120 ways
= 13!/10! = 1716
He can arrange his schedule in = 20160 ways
Comments
There are no comments.Copyright ©CuriousTab. All rights reserved.