Advertisements
Advertisements
Question
How many 6-digit telephone numbers can be constructed with digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 if each number starts with 35 and no digit appears more than once?
Advertisements
Solution
Total available digits = 10
Out of these, 3 and 5 have already been used to make the first two digits.
∴ Number of available digits = 8
The telephone number consists of 6 digits. The initial numbers have already been fixed as 35.
Since repetition is not allowed, the number of telephone numbers that can be formed is equal to the number of arrangements of the 8 digits, taken 4 at a time.
⇒ 8P4 =\[\frac{8!}{4!} = 8 \times 7 \times 6 \times 5 = 1680\]
APPEARS IN
RELATED QUESTIONS
Convert the following products into factorials:
(n + 1) (n + 2) (n + 3) ... (2n)
If (n + 3)! = 56 [(n + 1)!], find n.
Prove that:
If P (5, r) = P (6, r − 1), find r ?
If 5 P(4, n) = 6. P (5, n − 1), find n ?
If P (n, 5) = 20. P(n, 3), find n ?
If P(11, r) = P (12, r − 1) find r.
If P (n − 1, 3) : P (n, 4) = 1 : 9, find n.
If P (n, 5) : P (n, 3) = 2 : 1, find n.
If P (15, r − 1) : P (16, r − 2) = 3 : 4, find r.
If n +5Pn +1 =\[\frac{11 (n - 1)}{2}\]n +3Pn, find n.
Find the number of different 4-letter words, with or without meanings, that can be formed from the letters of the word 'NUMBER'.
How many three-digit numbers are there, with no digit repeated?
How many 3-digit even number can be made using the digits 1, 2, 3, 4, 5, 6, 7, if no digits is repeated?
In how many ways can the letters of the word 'FAILURE' be arranged so that the consonants may occupy only odd positions?
How many words can be formed out of the letters of the word, 'ORIENTAL', so that the vowels always occupy the odd places?
How many different words can be formed from the letters of the word 'GANESHPURI'? In how many of these words:
the letters P and I respectively occupy first and last place?
How many different words can be formed from the letters of the word 'GANESHPURI'? In how many of these words:
the vowels are always together?
In how many ways can a lawn tennis mixed double be made up from seven married couples if no husband and wife play in the same set?
m men and n women are to be seated in a row so that no two women sit together. if m > n then show that the number of ways in which they can be seated as\[\frac{m! (m + 1)!}{(m - n + 1) !}\]
How many words (with or without dictionary meaning) can be made from the letters in the word MONDAY, assuming that no letter is repeated, if all letters are used at a time.
How many three letter words can be made using the letters of the word 'ORIENTAL'?
Find the number of words formed by permuting all the letters of the following words:
INDEPENDENCE
How many words can be formed with the letters of the word 'UNIVERSITY', the vowels remaining together?
How many words can be formed with the letters of the word 'PARALLEL' so that all L's do not come together?
How many words can be formed by arranging the letters of the word 'MUMBAI' so that all M's come together?
How many permutations of the letters of the word 'MADHUBANI' do not begin with M but end with I?
Find the number of numbers, greater than a million, that can be formed with the digits 2, 3, 0, 3, 4, 2, 3.
In how many ways can the letters of the word ASSASSINATION be arranged so that all the S's are together?
Find the total number of ways in which six ‘+’ and four ‘−’ signs can be arranged in a line such that no two ‘−’ signs occur together.
Prove that: 4nC2n : 2nCn = [1 · 3 · 5 ... (4n − 1)] : [1 · 3 · 5 ... (2n − 1)]2.
Let r and n be positive integers such that 1 ≤ r ≤ n. Then prove the following:
nCr + 2 · nCr − 1 + nCr − 2 = n + 2Cr.
There are 10 persons named\[P_1 , P_2 , P_3 , . . . . , P_{10}\]
Out of 10 persons, 5 persons are to be arranged in a line such that in each arrangement P1 must occur whereas P4 and P5 do not occur. Find the number of such possible arrangements.
Write the number of diagonals of an n-sided polygon.
Write the number of parallelograms that can be formed from a set of four parallel lines intersecting another set of three parallel lines.
