Advertisements
Advertisements
प्रश्न
A test consists of 10 multiple choice questions. In how many ways can the test be answered if the first four questions have three choices and the remaining have five choices?
Advertisements
उत्तर
The first four questions have 3 choices.
So they can be answered in 34 ways.
The remaining 6 questions have 5 choices.
So they can be answered in 56 ways.
So all 10 questions can be answered in 34 × 56 ways.
APPEARS IN
संबंधित प्रश्न
Evaluate 4! – 3!
How many 3-digit even numbers can be made using the digits 1, 2, 3, 4, 6, 7, if no digit is repeated?
In how many ways can the letters of the word ASSASSINATION be arranged so that all the S’s are together?
How many three digit numbers can be formed by using the digits 0, 1, 3, 5, 7 while each digit may be repeated any number of times?
Evaluate each of the following:
P(6, 4)
The number of ways in which the letters of the word 'CONSTANT' can be arranged without changing the relative positions of the vowels and consonants is
In a room there are 12 bulbs of the same wattage, each having a separate switch. The number of ways to light the room with different amounts of illumination is
If (n+2)! = 60[(n–1)!], find n
- In how many ways can 8 identical beads be strung on a necklace?
- In how many ways can 8 boys form a ring?
The possible outcomes when a coin is tossed five times:
If `""^(("n" – 1))"P"_3 : ""^"n""P"_4` = 1 : 10 find n
If `""^10"P"_("r" - 1)` = 2 × 6Pr, find r
How many strings are there using the letters of the word INTERMEDIATE, if no two vowels are together
Choose the correct alternative:
If Pr stands for rPr then the sum of the series 1 + P1 + 2P2 + 3P3 + · · · + nPn is
The number of arrangements of the letters of the word BANANA in which two N's do not appear adjacently is ______.
In how many ways can 5 children be arranged in a line such that two particular children of them are always together
In how many ways can 5 children be arranged in a line such that two particular children of them are never together.
Suppose m men and n women are to be seated in a row so that no two women sit together. If m > n, show that the number of ways in which they can be seated is `(m!(m + 1)!)/((m - n + 1)1)`
Using the digits 1, 2, 3, 4, 5, 6, 7, a number of 4 different digits is formed. Find
| C1 | C2 |
| (a) How many numbers are formed? | (i) 840 |
| (b) How many number are exactly divisible by 2? | (i) 200 |
| (c) How many numbers are exactly divisible by 25? | (iii) 360 |
| (d) How many of these are exactly divisible by 4? | (iv) 40 |
The number of three-digit even numbers, formed by the digits 0, 1, 3, 4, 6, 7 if the repetition of digits is not allowed, is ______.
