SOLVER7 Study. Nothing Else.
Exercise 6.1 Q1(i)

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

Solution

👶 Simple Explanation

Simple Explanation

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 \).

📖 Forming 3-Digit Numbers with Repetition Allowed

Detailed Explanation

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.

Formula Used

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}) \).

Solution

  1. Step 1: Identify the available digits. We are given the digits \( 1, 2, 3, 4, 5 \), so there are \( 5 \) digits in total that can be used.
  2. Step 2: Understand the structure of the number. A 3-digit number has three places to fill: the hundreds place, the tens place, and the units place.
  3. Step 3: Count choices for the hundreds place. Any of the \( 5 \) digits can be placed here, so there are \( 5 \) choices.
  4. Step 4: Count choices for the tens place. Since repetition is allowed, the digit used in the hundreds place can be reused. So again all \( 5 \) digits are available, giving \( 5 \) choices.
  5. Step 5: Count choices for the units place. For the same reason, repetition is allowed, so this place also has \( 5 \) choices.
  6. Step 6: Apply the multiplication principle. Multiply the choices for all three positions: \[ 5 \times 5 \times 5 = 125 \]

Final Answer

The total number of 3-digit numbers that can be formed is \( 125 \).

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List the available digits: \( \{1, 2, 3, 4, 5\} \). This gives us \( 5 \) digits in total. — Reason: Knowing how many digits are available tells us the number of options at each position.
  2. Step 2: Recognise the structure: a 3-digit number has three distinct positions — the hundreds place, the tens place, and the units place. — Reason: Each position must be filled independently, so we treat each one as a separate choice.
  3. Step 3: Count the choices for the hundreds place. Any of the \( 5 \) digits may go here, so there are \( 5 \) choices. — Reason: No digit is excluded from the hundreds place, so all \( 5 \) are valid options.
  4. Step 4: Count the choices for the tens place. Because repetition is allowed, the digit already placed in the hundreds position can be reused. Therefore there are again \( 5 \) choices. — Reason: Repetition being allowed means selecting a digit does not remove it from future positions.
  5. Step 5: Count the choices for the units place. By the same reasoning — repetition is permitted — all \( 5 \) digits remain available, giving \( 5 \) choices. — Reason: Every digit is still eligible at this position, just as it was for the previous two positions.
  6. Step 6: Apply the Fundamental Principle of Counting by multiplying the choices for all three positions: \[ 5 \times 5 \times 5 = 125 \] — Reason: When choices at different positions are independent of one another, the total count is their product.

Final Answer

The total number of 3-digit numbers that can be formed is \( 125 \).

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Available digits: \( \{1, 2, 3, 4, 5\} \); repetition allowed, so each place has \( 5 \) choices.
  2. Step 2: Total 3-digit numbers \( = 5 \times 5 \times 5 = 125 \)

Answer: The total number of 3-digit numbers that can be formed is \( 125 \).

➕ More Examples

More Examples

Example 1

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

Example 2

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

🎯 Try a Similar Question

Try a Similar Question

Question: How many 4-digit numbers can be formed using the digits 2, 3, 5, 7, and 9, if repetition of digits is allowed?

Solution

  1. Step 1: Identify the number of positions: We need to form a 4-digit number, so there are 4 positions to fill: thousands place, hundreds place, tens place, and units place.
  2. Step 2: Count the choices for each position: The available digits are 2, 3, 5, 7, and 9 — a total of 5 digits. Since repetition is allowed, each of the 4 positions can be filled by any of these 5 digits. So the number of choices for each position is 5.
  3. Step 3: Apply the Fundamental Principle of Counting: 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\]
  4. Step 4: Calculate the result: Evaluating the expression: \[5^4 = 625\] Therefore, the total number of 4-digit numbers that can be formed is 625.

Answer: The total number of 4-digit numbers that can be formed is \(625\).

Everything you get with Solver7

More questions in Permutations and Combinations