Chapter 5: Problem 348
The least positive integer \(\mathrm{n}\) for which \({ }^{\mathrm{n}-1} \mathrm{C}_{5}+{ }^{\mathrm{n}-1} \mathrm{C}_{6}<{ }^{\mathrm{n}} \mathrm{C}_{7}\) is (a) 14 (b) 15 (c) 16 (d) 28
Chapter 5: Problem 348
The least positive integer \(\mathrm{n}\) for which \({ }^{\mathrm{n}-1} \mathrm{C}_{5}+{ }^{\mathrm{n}-1} \mathrm{C}_{6}<{ }^{\mathrm{n}} \mathrm{C}_{7}\) is (a) 14 (b) 15 (c) 16 (d) 28
All the tools & learning materials you need for study success - in one app.
Get started for freeThe number of ordered pairs of integers \((x, y)\) satisfying the equation \(x^{2}+6 x+y^{2}=4\) is (a) 2 (b) 4 (c) 6 (d) 8
10 person are to be arranged around a round table. 3 persons wish to sit as a group number of ways the arrangement can be made is (a) \(9 ! \times 3 !\) (b) \(8 ! \times 3 !\) (c) \(7 ! \times{ }^{8} \mathrm{P}_{3}\) (d) \(7 ! \times 3 !\)
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
If \(\mathrm{n}={ }^{\mathrm{m}} \mathrm{C}_{2}\) then \({ }^{\mathrm{n}} \mathrm{C}_{2}\) equal to. (a) \({ }^{\mathrm{m}+1} \mathrm{C}_{4}\) (b) \({ }^{\mathrm{m}-1} \mathrm{C}_{4}\) (c) \({ }^{\mathrm{m}+2} \mathrm{C}_{4}\) (d) None of these
The first 12 letters of the english alphabet are to be written at random so that there are exactly 4 letters between \(\mathrm{A}\) and \(\mathrm{B}\). the number of ways this can be done is (a) \(7 \cdot 10 !\) (b) \(2 \cdot 10 !\) (c) \(21 \cdot 10 !\) (d) \(14 \cdot 10 !\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.