Advertisements
Advertisements
प्रश्न
Each of the digits 1, 1, 2, 3, 3 and 4 is written on a separate card. The six cards are then laid out in a row to form a 6-digit number. How many of these 6-digit numbers are divisible by 4?
Advertisements
उत्तर
In order to get the 6-digit number divisible by 4
The last two digits must be divisible by 4
∴ The last two digits should be 12 or 24 or 32
| 24 | ||||
| 1 | 2 | 3 | 4 | 5 |
Let the last box be filled with 24.
The remaining 4 boxes can be filled with the remaining digits
1, 1, 3, 3 in `(4!)/(2! xx 2!)` ways.
| 12 | ||||
| 1 | 2 | 3 | 4 | 5 |
Let the last box be filled with 12.
The remaining 4 boxes can be filled with the remaining digits.
1, 3, 3, 4 in `(4!)/(2!)` ways
| 32 | ||||
| 1 | 2 | 3 | 4 | 5 |
Let the last box be filled with 32.
The remaining 4 boxes can be filled with the remaining digits
The total number of 6 digit numbers which are divisible by 4 is
= `(4!)/(2! xx 2!) + (4!)/(2!) + (4!)/(2!)`
= `(1 xx 2 xx 3 xx 4)/(1 xx 2 xx 1 xx 2) + (1 xx 2 xx 3 xx 4)/(1 xx 2) + (1 xx 2 xx 3 xx 4)/(1 xx 2)`
= 6 + 12 + 12
= 30
∴ Required number of 6-digit numbers = 30
APPEARS IN
संबंधित प्रश्न
Find r if `""^5P_r = 2^6 P_(r-1)`
Find r if `""^5P_r = 2^6 P_(r-1)`
How many words, with or without meaning can be made from the letters of the word MONDAY, assuming that no letter is repeated, if
(i) 4 letters are used at a time,
(ii) all letters are used at a time,
(iii) all letters are used but first letter is a vowel?
In how many ways can the letters of the word ASSASSINATION be arranged so that all the S’s are together?
How many numbers of six digits can be formed from the digits 0, 1, 3, 5, 7 and 9 when no digit is repeated? How many of them are divisible by 10 ?
In how many ways can 7 letters be posted in 4 letter boxes?
Evaluate each of the following:
8P3
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
Number of all four digit numbers having different digits formed of the digits 1, 2, 3, 4 and 5 and divisible by 4 is
A 5-digit number divisible by 3 is to be formed using the digits 0, 1, 2, 3, 4 and 5 without repetition. The total number of ways in which this can be done is
The product of r consecutive positive integers is divisible by
The number of ways in which the letters of the word ARTICLE can be arranged so that even places are always occupied by consonants is
The possible outcomes when a coin is tossed five times:
Determine the number of permutations of the letters of the word SIMPLE if all are taken at a time?
A test consists of 10 multiple choice questions. In how many ways can the test be answered if question number n has n + 1 choices?
Find the number of strings that can be made using all letters of the word THING. If these words are written as in a dictionary, what will be the 85th string?
How many words (with or without dictionary meaning) can be made from the letters of the word MONDAY, assuming that no letter is repeated, if
| C1 | C2 |
| (a) 4 letters are used at a time | (i) 720 |
| (b) All letters are used at a time | (ii) 240 |
| (c) All letters are used but the first is a vowel | (iii) 360 |
Let b1, b2, b3, b4 be a 4-element permutation with bi ∈ {1, 2, 3, .......,100} for 1 ≤ i ≤ 4 and bi ≠ bj for i ≠ j, such that either b1, b2, b3 are consecutive integers or b2, b3, b4 are consecutive integers. Then the number of such permutations b1, b2, b3, b4 is equal to ______.
