How many 4-letter code can be formed using the first 10 letters of the English alphabet, if no letter can be repeated?
Solution and Explanation
It is given that the 5-digit telephone numbers always start with 67.
Therefore, there will be as many phone numbers as there are ways of filling 3 vacant places 
by the digits 0 - 9, keeping in mind that the digits cannot be repeated.
The units place can be filled by any of the digits from 0 - 9, except digits 6 and 7. Therefore, the units place can be filled in 8 different ways following which, the tens place can be filled in by any of the remaining 7 digits in 7 different ways, and the hundreds place can be filled in by any of the remaining 6 digits in 6 different ways.
Therefore, by multiplication principle, the required number of ways in which 5-digit telephone numbers can be constructed is 8 x 7 x 6 = 336
Top Questions on permutations and combinations
- Let A = \{-2, -1, 0, 1, 2, 3, 4\. Let R be a relation on A defined by xRy if and only if \(2x + y \le 2\). Let \(l\) be the number of elements in R. Let \(m\) and \(n\) be the minimum number of elements required to be added in R to make it reflexive and symmetric relations respectively. Then \(l + m + n\) is equal to :}
- JEE Main - 2026
- Mathematics
- permutations and combinations
- Let \( S=\{1,2,3,4,5,6,7,8,9\} \). Let \( x \) be the number of 9-digit numbers formed using the digits of the set \( S \) such that only one digit is repeated and it is repeated exactly twice. Let \( y \) be the number of 9-digit numbers formed using the digits of the set \( S \) such that only two digits are repeated and each of these is repeated exactly twice. Then:
- JEE Main - 2026
- Mathematics
- permutations and combinations
The number of strictly increasing functions \(f\) from the set \(\{1, 2, 3, 4, 5, 6\}\) to the set \(\{1, 2, 3, ...., 9\}\) such that \(f(i)>i\) for \(1 \le i \le 6\), is equal to:
- JEE Main - 2026
- Mathematics
- permutations and combinations
- If \( A = \{ 1, 2, 3, 4, 5, 6 \}, B = \{ 1, 2, 3, 4, 5, 6, 7, 8, 9 \} \), then the number of strictly increasing functions from \( A \to B \) such that \( f(i) \neq i \) for \( i = 1, 2, 3, 4, 5, 6 \) is
- JEE Main - 2026
- Mathematics
- permutations and combinations
- \[ \left(\frac{1}{^{15}C_0}+\frac{1}{^{15}C_1}\right) \left(\frac{1}{^{15}C_1}+\frac{1}{^{15}C_2}\right) \cdots \left(\frac{1}{^{15}C_{12}}+\frac{1}{^{15}C_{13}}\right) = \frac{\alpha^{13}}{^{14}C_0\cdot {}^{14}C_1\cdot {}^{14}C_2\cdots {}^{14}C_{12}} \] If so, then find the value of \(30\alpha\).
- JEE Main - 2026
- Mathematics
- permutations and combinations
Questions Asked in CBSE Class XI exam
- Balance the following redox reactions by ion-electron method:
(a)MnO4- (aq) + I - (aq) → MnO2(s) + I2(s) (in basic medium)
(b) MnO4- (aq) + SO2(g) → Mn2+(aq) +HSO4- (aq) (in acidic solution)
(c) H2O2(aq)+Fe2+(aq) → Fe3+ (aq) + H2O (l) (in acidic solution)
(d) Cr2O72-+ SO2(g) → Cr3+ (aq) +SO42- (aq) (in acidic solution)- CBSE Class XI
- Oxidation Number
- Write the resonance structures for SO3 , NO2 and NO3-
- CBSE Class XI
- Kossel-Lewis Approach to Chemical Bonding
- At 700 K, equilibrium constant for the reaction:
\(H_2 (g) + I_2 (g) ⇋ 2HI (g)\)
is 54.8. If 0.5 mol L–1 of HI(g) is present at equilibrium at 700 K, what are the concentration of H2(g) and I2(g) assuming that we initially started with HI(g) and allowed it to reach equilibrium at 700 K?- CBSE Class XI
- Law Of Chemical Equilibrium And Equilibrium Constant
- Find the mean deviation about the mean for the data 4, 7, 8, 9, 10, 12, 13, 17.
- CBSE Class XI
- Statistics
Find the mean deviation about the mean for the data 38, 70, 48, 40, 42, 55, 63, 46, 54, 44.
- CBSE Class XI
- Statistics
Concepts Used:
Permutations and Combinations
Permutation:
Permutation is the method or the act of arranging members of a set into an order or a sequence.
- In the process of rearranging the numbers, subsets of sets are created to determine all possible arrangement sequences of a single data point.
- A permutation is used in many events of daily life. It is used for a list of data where the data order matters.
Combination:
Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.
- Combination refers to the combination of about n things taken k at a time without any repetition.
- The combination is used for a group of data where the order of data does not matter.