How many \(4\)-letter code can be formed using the first \(10\) letters of the English alphabet, if no letter can be repeated \(?\)
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine you have 10 different coloured beads and you want to pick 4 of them to make a bracelet. The order matters — a red-blue-green-yellow bracelet is different from a blue-red-green-yellow one. For the first spot you have 10 choices, then 9 remain, then 8, then 7. Multiply all those choices together. That gives you the total number of different 4-letter codes you can make from the first 10 letters of the alphabet without repeating any letter.
Answer: The number of 4-letter codes is \( {}^{10}P_{4} = 5040 \).
Here we must form a 4-letter code from the first 10 letters of the English alphabet, namely \( \{a, b, c, d, e, f, g, h, i, j\} \). Since a code depends on the ORDER of the letters (for example, \( abcd \) is a different code from \( bacd \)), this is a problem of PERMUTATIONS. Also, since no letter can be repeated, each letter chosen is used only once. When we select and arrange \( r \) objects out of \( n \) distinct objects, the number of ways is given by the permutation formula. Another way to think about it is the fundamental principle of counting: fill each of the 4 positions one at a time, and multiply the choices.
\[ {}^{n}P_{r} = \frac{n!}{(n-r)!} \]
The number of 4-letter codes is \( {}^{10}P_{4} = 5040 \).
A common mistake is using combinations \( {}^{10}C_{4} \) instead of permutations. Combinations ignore order, but a code like \( abcd \) is different from \( dcba \), so order matters and permutations must be used.
The number of 4-letter codes is \( {}^{10}P_{4} = 5040 \).
One common mistake: treating the problem as a combination (using \( {}^{10}C_{4} \)) and ignoring that different arrangements of the same letters produce different codes — always check whether order matters before choosing between permutations and combinations.
Answer: The number of 4-letter codes is \( {}^{10}P_{4} = 5040 \).
Question: How many 3-letter codes can be formed using the first 8 letters of the English alphabet, if no letter can be repeated?
Solution: We need to form 3-letter codes from 8 distinct letters (a, b, c, d, e, f, g, h) without repetition. Here, the total number of available letters is \( n = 8 \) and the number of letters to be chosen for each code is \( r = 3 \). Using the permutation formula: \[ {}^{n}P_{r} = \frac{n!}{(n - r)!} \] Substituting \( n = 8 \) and \( r = 3 \): \[ {}^{8}P_{3} = \frac{8!}{(8 - 3)!} = \frac{8!}{5!} \] Expanding: \[ {}^{8}P_{3} = \frac{8 \times 7 \times 6 \times 5!}{5!} = 8 \times 7 \times 6 \] Calculating: \[ {}^{8}P_{3} = 336 \] Alternatively, using the Fundamental Principle of Counting: the first position can be filled in 8 ways, the second in 7 ways (one letter used), and the third in 6 ways (two letters used), giving \( 8 \times 7 \times 6 = 336 \).
Answer: 336
Question: A security system generates 5-digit PIN codes using the digits 1 through 9 (i.e., the first 9 positive integers), with no digit repeated. How many such PIN codes are possible?
Solution: We need to form 5-digit codes from 9 distinct digits (1, 2, 3, 4, 5, 6, 7, 8, 9) without repetition. Here, the total number of available digits is \( n = 9 \) and the number of digits to be selected for each PIN is \( r = 5 \). Using the permutation formula: \[ {}^{n}P_{r} = \frac{n!}{(n - r)!} \] Substituting \( n = 9 \) and \( r = 5 \): \[ {}^{9}P_{5} = \frac{9!}{(9 - 5)!} = \frac{9!}{4!} \] Expanding: \[ {}^{9}P_{5} = \frac{9 \times 8 \times 7 \times 6 \times 5 \times 4!}{4!} = 9 \times 8 \times 7 \times 6 \times 5 \] Calculating step by step: \( 9 \times 8 = 72 \), then \( 72 \times 7 = 504 \), then \( 504 \times 6 = 3024 \), then \( 3024 \times 5 = 15120 \). \[ {}^{9}P_{5} = 15120 \] So there are 15120 possible PIN codes.
Answer: 15120
Question: How many 3-letter codes can be formed using the first 12 letters of the English alphabet, if no letter can be repeated?
Answer: The number of 3-letter codes is \( {}^{12}P_{3} = 1320 \).