Advertisements
Advertisements
Question
How many 6-digit telephone numbers can be constructed with the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 if each numbers starts with 35 and no digit appear more than once?
Advertisements
Solution
Given that each number starts with 35. We need a 6 digit number. So we have to fill only one’s place, 10’s place, 100th place, and 1000th places. We have to use 10 digits.
In these digits, 3 and 5 should not be used as a repetition of digits is not allowed. Except for these two digits, we have to use 8 digits. One’s place can be filled by any of the 8 digits in different ways, 10’s place can be filled by the remaining 7 digits in 7 different ways.
100th place can be filled by the remaining 6 different ways and 1000th place can be filled by the remaining 5 digits in 5 different ways.
∴ Number of 6 digit telephone numbers = 8 × 7 × 6 × 5 = 1680
APPEARS IN
RELATED QUESTIONS
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?
Find x in each of the following:
Write the number of arrangements of the letters of the word BANANA in which two N's come together.
Write the number of ways in which 7 men and 7 women can sit on a round table such that no two women sit together ?
Write the number of ways in which 6 men and 5 women can dine at a round table if no two women sit together ?
The number of six letter words that can be formed using the letters of the word "ASSIST" in which S's alternate with other letters is
For all n > 0, nC1 + nC2 + nC3 + …… + nCn is equal to:
In how many ways can the letters of the word SUCCESS be arranged so that all Ss are together?
In how many ways 3 mathematics books, 4 history books, 3 chemistry books and 2 biology books can be arranged on a shelf so that all books of the same subjects are 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)`
