The number of ways in which the letters of the word RAILINGS can be arranged such that R & S always come together is
Count R & S as only 1 space or letter so that RS or SR can be arranged => 7! x 2!
But in the word RAILINGS, I repeated for 2 times => 7! x 2!/2! = 7! ways = 5040 ways.
Given Word is PROMISE.
Number of letters in the word PROMISE = 7
Number of ways 7 letters can be arranged = 7! ways
Number of Vowels in word PROMISE = 3 (O, I, E)
Number of ways the vowels can be arranged that 3 Vowels come together = 5! x 3! ways
Now, the number of ways of arrangements so that three vowels should not come together
= 7! - (5! x 3!) ways = 5040 - 720 = 4320.
The given word HAPPYHOLI has 9 letters
These 9 letters can e arranged in 9! ways.
But here in the given word letters H & P are repeated twice each
Therefore, Number of ways these 9 letters can be arranged is
We first count the number of committee in which
(i). Mr. Y is a member
(ii). the ones in which he is not
Case (i): As Mr. Y agrees to be in committee only where Mrs. Z is a member.
Now we are left with (6-1) men and (4-2) ladies (Mrs. X is not willing to join).
We can choose 1 more in5+
=7 ways.
Case (ii): If Mr. Y is not a member then we left with (6+4-1) people.
we can select 3 from 9 in
=84 ways.
Thus, total number of ways is 7+84= 91 ways.
There are 8 students and the maximum capacity of the cars together is 9.
We may divide the 8 students as follows
Case I: 5 students in the first car and 3 in the second
Case II: 4 students in the first car and 4 in the second
Hence, in Case I: 8 students are divided into groups of 5 and 3 in8C3 ways.
Similarly, in Case II: 8 students are divided into two groups of 4 and 4 in 8C4ways.
Therefore, the total number of ways in which 8 students can travel is:
=56 + 70= 126
There are 7 letters in the word DRAUGHT, the two vowels are A and U. Since, the vowels are not to be separated, AU can be considered as one entity. Therefore, the number of letters will be 6 instead of 7. The permutations will be P(6,6) = 6! ways.
But the two vowels A and U can be arranged in two ways, i.e. AU and UA. The required number of arrangements = 2!.6! = 1440 ways.
Total number of flowers = (8+7+6) = 21.
Let E = event that the flower drawn is neither red nor green.
= event taht the flower drawn is blue.
--> n(E)= 7
--> P(E)= =
We may have (1 boy and 3 girls)or(2boys and 2 girls)or(3 boys and 1 girl)or(4 boys).
Required number of ways = (
) +
+ (
) + (
)
= (24+90+80+15)
= 209.
Given word is TRANSFORMER.
Number of letters in the given word = 11 (3 R's)
Required, number of ways the letters of the word 'TRANSFORMER' can be arranged such that 'N' and 'S' always come together is
10! x 2!/3!
= 3628800 x 2/6
= 1209600
Here in 100P2, P says that permutations and is defined as in how many ways 2 objects can be selected from 100 and can be arranged.
That can be done as,
= 100!/(100 - 2)!
= 100 x 99 x 98!/98!
= 100 x 99
= 9900.
Comments
There are no comments.Copyright ©CuriousTab. All rights reserved.