Chapter 5: Problem 366
The number of ways in which in a necklace can be formed by using 5 identical red beads and 6 identical black beads is (a) \([(11 !) /(6 ! 4 !)]\) (b) \({ }^{11} \mathrm{P}_{6}\) (c) \([(10 !) /(2(6 ! 5 !)]\) (d) None of these
Chapter 5: Problem 366
The number of ways in which in a necklace can be formed by using 5 identical red beads and 6 identical black beads is (a) \([(11 !) /(6 ! 4 !)]\) (b) \({ }^{11} \mathrm{P}_{6}\) (c) \([(10 !) /(2(6 ! 5 !)]\) (d) None of these
All the tools & learning materials you need for study success - in one app.
Get started for freeLet \(\mathrm{T}_{\mathrm{n}}\) denote the no of triangles which can be formed using the vertices of regular polygon of \(\mathrm{n}\) sides if \(\mathrm{T}_{(\mathrm{n}+1)}-\mathrm{T}_{\mathrm{n}}=21\) then \(\mathrm{n}=\) is (a) 4 (b) 5 (c) 6 (d) 7
In a circus there are 10 cages for accommodating 10 animals out of these 4 cages are so small that five out of ten animals can not enter into them. In how many ways will it be possible to accommodate 10 animals in these 10 cages? (a) 66400 (b) 86400 (c) 96400 (d) 46900
The number of arrangements that can be made out of the letter of the word " SUCCESS " so that the all S's do not come together is (a) 60 (b) 120 (c) 360 (d) 420
In chess championship 153 games have been played. If a player with every other player plays only once, then the number of players are (a) 17 (b) 51 (c) 18 (d) 35
The vertices of a regular polygon of 12 sides are joined to form triangles. The number of triangles which do not have their sides as the sides of the polygon is (a) 96 (b) 108 (c) 112 (d) 220
What do you think about this solution?
We value your feedback to improve our textbook solutions.