How many \(3\)-digit numbers can be formed from the digits \(1, 2, 3, 4\) and \(5\) assuming that repetition of the digits is allowed \(?\)
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine you have 5 coloured cards numbered 1 to 5. You want to pick a card for each of three boxes: a hundreds box, a tens box, and a units box. You can use any card as many times as you like. Each box has 5 choices. Multiply all the choices together: \( 5 \times 5 \times 5 = 125 \). That gives every possible 3-digit number you can make. It is just like choosing an outfit when any item can be worn on any day — the choices multiply.
Answer: The total number of 3-digit numbers that can be formed is \( 125 \).
This problem uses the Fundamental Principle of Counting (also called the multiplication principle). It states that if one task can be done in \( m \) ways and a second independent task can be done in \( n \) ways, then both tasks together can be done in \( m \times n \) ways. A 3-digit number has three positions: hundreds, tens, and units. We must decide how many choices exist for each position and then multiply these choices. Since repetition is allowed, using a digit in one position does not remove it from being used again in another position, so every position has the same number of choices.
By the Fundamental Principle of Counting, total ways \( = (\text{choices for position 1}) \times (\text{choices for position 2}) \times (\text{choices for position 3}) \).
The total number of 3-digit numbers that can be formed is \( 125 \).
A common mistake is to reduce the number of choices for each successive place (using \( 5 \times 4 \times 3 \)). That would be correct only when repetition is NOT allowed. Since repetition is allowed here, every place keeps all \( 5 \) choices.
The total number of 3-digit numbers that can be formed is \( 125 \).
One common mistake: students sometimes subtract digits after using them (as if repetition were not allowed), incorrectly computing \( 5 \times 4 \times 3 = 60 \) instead of \( 5 \times 5 \times 5 = 125 \). Always check whether the problem says repetition is allowed or not before deciding how many choices remain at each step.
Answer: The total number of 3-digit numbers that can be formed is \( 125 \).
Question: How many 4-digit numbers can be formed using the digits 2, 3, 5, 7, and 8, if repetition of digits is allowed?
Solution: We need to form 4-digit numbers using the digits \( \{2, 3, 5, 7, 8\} \), which is a set of 5 digits, with repetition allowed. There are 4 positions to fill: thousands, hundreds, tens, and units. Since repetition is allowed, each position can be filled by any of the 5 digits. Number of choices for the thousands place: \( 5 \) Number of choices for the hundreds place: \( 5 \) Number of choices for the tens place: \( 5 \) Number of choices for the units place: \( 5 \) By the Fundamental Principle of Counting, the total number of 4-digit numbers that can be formed is: \[ 5 \times 5 \times 5 \times 5 = 5^4 = 625 \]
Answer: 625
Question: A lock has a 3-digit code where each digit is chosen from the set \( \{0, 1, 2, 3, 4, 5, 6\} \). How many different codes are possible if repetition of digits is allowed? (Note: codes like 007 and 042 are valid 3-digit codes for this lock.)
Solution: We need to form 3-digit codes using the digits \( \{0, 1, 2, 3, 4, 5, 6\} \), which is a set of 7 digits, with repetition allowed. There are 3 positions to fill in the code. Since repetition is allowed and any digit (including 0) is valid in every position for a lock code: Number of choices for the first position: \( 7 \) Number of choices for the second position: \( 7 \) Number of choices for the third position: \( 7 \) By the Fundamental Principle of Counting, the total number of possible codes is: \[ 7 \times 7 \times 7 = 7^3 = 343 \]
Answer: 343
Question: How many 4-digit numbers can be formed using the digits 2, 3, 5, 7, and 9, if repetition of digits is allowed?
Answer: The total number of 4-digit numbers that can be formed is \(625\).