How many \(3\)-digit numbers can be formed by using the digits \(1\) to \(9\) if no digit is repeated \(?\)
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine you have 9 numbered cards labeled 1 through 9. You want to pick 3 cards and arrange them in a row to make a 3-digit number. For the first spot, you can pick any of the 9 cards. Once one card is used, only 8 remain for the second spot. After two cards are gone, only 7 are left for the last spot. Multiply those choices together: 9 times 8 times 7 gives you the total number of different 3-digit numbers you can make.
Answer: The number of 3-digit numbers that can be formed is \( 504 \).
We are asked to form 3-digit numbers using the digits from 1 to 9, with no digit repeated. Since a 3-digit number has three places (hundreds, tens, units), we need to fill each place with one digit, making sure we do not reuse a digit already placed. The key idea here is the Fundamental Principle of Counting: if one event can occur in \( m \) ways and a following event in \( n \) ways, then both events together can occur in \( m \times n \) ways. Because the order of digits matters (for example, \( 123 \) and \( 321 \) are different numbers) and no digit repeats, this is essentially a permutation of choosing 3 digits from 9 available digits.
Number of arrangements \( = {}^{9}P_{3} = \frac{9!}{(9-3)!} \) OR by the multiplication principle: \( 9 \times 8 \times 7 \).
The number of 3-digit numbers that can be formed is \( 504 \).
A common mistake is to keep all 9 choices for every place (i.e. computing \( 9 \times 9 \times 9 \)), which ignores the condition that no digit may be repeated. Once a digit is used, it must be removed from the available options, so the counts decrease to \( 9, 8, 7 \).
The number of 3-digit numbers that can be formed is \( 504 \).
One common mistake: Students sometimes forget that digits cannot be repeated and multiply \( 9 \times 9 \times 9 \) instead of \( 9 \times 8 \times 7 \), which overcounts by allowing the same digit to appear more than once in the number.
Answer: The number of 3-digit numbers that can be formed is \( 504 \).
Question: How many 4-digit numbers can be formed using the digits 2, 3, 4, 5, 6, 7, 8 if no digit is repeated?
Solution: We need to form 4-digit numbers using the 7 digits \( \{2, 3, 4, 5, 6, 7, 8\} \) without repetition. We have 4 positions to fill: thousands, hundreds, tens, and units. For the thousands place: any of the 7 digits can be chosen, giving 7 choices. For the hundreds place: one digit has been used, so 6 choices remain. For the tens place: two digits have been used, so 5 choices remain. For the units place: three digits have been used, so 4 choices remain. By the Fundamental Principle of Counting, the total number of 4-digit numbers is: \[ 7 \times 6 \times 5 \times 4 \] This is the same as \( {}^{7}P_{4} \): \[ {}^{7}P_{4} = \frac{7!}{(7-4)!} = \frac{7!}{3!} = \frac{7 \times 6 \times 5 \times 4 \times 3!}{3!} = 7 \times 6 \times 5 \times 4 = 840 \]
Answer: 840 four-digit numbers can be formed.
Question: In how many ways can a 5-letter code be formed using the letters A, B, C, D, E, F, G, H (all distinct) if no letter is repeated?
Solution: We need to form a 5-letter code from the 8 distinct letters \( \{A, B, C, D, E, F, G, H\} \) without repeating any letter. We have 5 positions to fill. For the 1st position: any of the 8 letters can be chosen, giving 8 choices. For the 2nd position: one letter has been used, so 7 choices remain. For the 3rd position: two letters have been used, so 6 choices remain. For the 4th position: three letters have been used, so 5 choices remain. For the 5th position: four letters have been used, so 4 choices remain. By the Fundamental Principle of Counting, the total number of 5-letter codes is: \[ 8 \times 7 \times 6 \times 5 \times 4 \] This equals \( {}^{8}P_{5} \): \[ {}^{8}P_{5} = \frac{8!}{(8-5)!} = \frac{8!}{3!} = \frac{8 \times 7 \times 6 \times 5 \times 4 \times 3!}{3!} = 8 \times 7 \times 6 \times 5 \times 4 = 6720 \]
Answer: 6720 five-letter codes can be formed.
Question: How many 4-digit numbers can be formed by using the digits 1 to 8, if no digit is repeated?
Answer: The number of 4-digit numbers that can be formed is \( 1680 \).