1 million distinct 3 digit initials are needed.
Let the number of required alphabets in the language be ?n?.
Therefore, using ?n? alphabets we can form n * n * n = distinct 3 digit initials.
Note distinct initials is different from initials where the digits are different.
For instance, AAA and BBB are acceptable combinations in the case of distinct initials while they are not permitted when the digits of the initials need to be different.
This different initials = 1 million
i.e. (1 million = )
=> n = = 100
Hence, the language needs to have a minimum of 100 alphabets to achieve the objective.
There are 4 books on fairy tales and they have to be put together. They can be arranged in 4! ways.
Similarly, there are 5 novels.They can be arranged in 5! ways.
And there are 3 plays.They can be arranged in 3! ways.
So, by the counting principle all of them together can be arranged in 4!´5!´3! ways = 17280
For a triangle, we need 3 non-collinear points. So with 12 points (when all the 12 are such that any three non-collinear is . But among them 8 points are collinear.
If all these 8 points are different we get triangles as they are collinear.
In triangles, we do not get triangles
Therefore, The number of triangles we get = = 164
Given in the question that, there are 7 boys and 6 girls.
Team members = 5
Now, required number of ways in which a team of 5 having atleast 3 girls in the team =
We can initially arrange the six boys in 6! ways.
Having done this, now three are seven places and six girls to be arranged. This can be done in ?P? ways.
Hence required number of ways = 6! x ?P?
Digits are 0,1,2,3,4,5,6,7,8,9. So no. of digits are 10
First all possible case => 9(0 excluded) x 10 x 10 = 900
Second no repetition allowed =>9 x 9 x 8 = 648
Third all digits are same => 9 (111,222,333,444,555,666,777,888,999)
Three digit numbers where two of the three digits are same = 900 - 648 - 9 = 243 ;
- 7 = 14
There are 15 dots in total,and to make a triangle we need to select any three of those dots.
So, = 455
The question requires you to find number of the outcomes in which at most 3 coins turn up as heads.
i.e., 0 coins turn heads or 1 coin turns head or 2 coins turn heads or 3 coins turn heads.
The number of outcomes in which 0 coins turn heads is =1
The number of outcomes in which 1 coin turns head is = =6
The number of outcomes in which 2 coins turn heads is =15
The number of outcomes in which 3 coins turn heads is =20
Therefore, total number of outcomes =1+6+15+20= 42 outcomes
All the boxes contain distinct number of chocolates.
For each combination of 4 out of 8 boxes, the box with the greatest number has to be given to the first person, the box with the second highest to the second person and so on.
The number of ways of giving 4 boxes to the 4 person is: 8 = 70
The number of words beign with A is 4!
The number of words beign with E is 4!
The number of words beign with M is 4!
The number of words beign with R is 4!
Number of words beign with VA is 3!
Words beign with VE are VEAMR
VEARM
VEMAR
VEMRA
VERAM
VERMA
Therefore, The Rank of the word VERMA = 4 x 4! + 3! + 6 = 96 + 6 + 6 =108
Comments
There are no comments.Copyright ©CuriousTab. All rights reserved.