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 freeThe number of ways in which the letter of the word "ARRANGE" can be arranged such that both \(\mathrm{R}\) do not come together is (a) 360 (b) 900 (c) 1260 (d) 1620
If \({ }^{189} \mathrm{C}_{35}+{ }^{189} \mathrm{C}_{\mathrm{x}}={ }^{190} \mathrm{C}_{\mathrm{x}}\) then \(\mathrm{x}\) is equal to (a) 34 (b) 35 (c) 36 (d) 37
The number of ways of distributing 8 identical balls in 3 distinct boxes so that no box is empty is (a) 5 (b) \({ }^{8} \mathrm{C}_{3}\) (c) 38 (d) 21
The maximum no. of points into which 4 circles and 4 straight lines intersect is (a) 26 (b) 56 (c) 50 (d) 72
The product of n natural number \(\mathrm{n} \geq 2\) is (a) not divisible by n (b) divisible by \(\mathrm{n}\), but not by \(2 \mathrm{n}\) (c) divisible by \(2 \mathrm{n}\), but not by n! (d) divisible by n!
What do you think about this solution?
We value your feedback to improve our textbook solutions.