SOLVER7 Study. Nothing Else.
Chapter 6 Examples Q10

How many \(4-\)digit numbers can be formed by using the digits \(1\) to \(9\) if repetition of digits is not allowed?

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have 9 different coloured balls labelled 1 through 9. You want to place exactly 4 of them in a row of 4 boxes. The first box has 9 balls to pick from. Once you pick one, only 8 balls are left for the second box. The third box gets 7 choices, and the fourth gets 6. Multiply all those choices together: \( 9 \times 8 \times 7 \times 6 = 3024 \). That is how many different 4-digit numbers you can build without using any digit twice.

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

📖 Forming 4-Digit Numbers Without Repetition

Detailed Explanation

We are given the digits \( 1, 2, 3, 4, 5, 6, 7, 8, 9 \), which is a total of \( 9 \) distinct digits. Notice that \( 0 \) is NOT included, so every one of these digits can be placed in any position without worry. A 4-digit number has four places: thousands, hundreds, tens and units. We must fill each of these places with a digit. The key phrase is 'repetition is not allowed', which means once a digit is used in one place, it cannot be reused in another place. To count arrangements like this, we use the Fundamental Principle of Counting: if one task can be done in \( m \) ways and a second task in \( n \) ways, then both together can be done in \( m \times n \) ways. Since each choice reduces the pool of available digits by one, this is essentially a permutation of \( 9 \) digits taken \( 4 \) at a time.

Formula Used

\( {}^{n}P_{r} = \dfrac{n!}{(n-r)!} \), here \( n = 9 \) and \( r = 4 \).

Solution

  1. Step 1: Identify the digits and places. Available digits are \( 1, 2, 3, 4, 5, 6, 7, 8, 9 \), giving \( 9 \) choices in total. A 4-digit number has four positions to fill: thousands, hundreds, tens, units.
  2. Step 2: Fill the thousands place. Any of the \( 9 \) digits can be used, so there are \( 9 \) choices for the first (thousands) place.
  3. Step 3: Fill the hundreds place. Since repetition is not allowed, one digit is already used, leaving \( 8 \) choices for the hundreds place.
  4. Step 4: Fill the tens place. Two digits are now used, so \( 7 \) digits remain, giving \( 7 \) choices for the tens place.
  5. Step 5: Fill the units place. Three digits are used, so \( 6 \) choices remain for the units place.
  6. Step 6: Apply the Fundamental Principle of Counting by multiplying the choices: \[ 9 \times 8 \times 7 \times 6 = 3024 \] This is exactly \( {}^{9}P_{4} = \dfrac{9!}{5!} = 3024 \).

Final Answer

The number of 4-digit numbers that can be formed is \( 3024 \).

Common Mistake

A common mistake is to allow repetition and compute \( 9 \times 9 \times 9 \times 9 \), or to keep multiplying by \( 9 \) for each place. Since repetition is not allowed, the number of available digits must decrease by one at every step, giving \( 9 \times 8 \times 7 \times 6 \), not \( 9^4 \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List the available digits: \( 1, 2, 3, 4, 5, 6, 7, 8, 9 \), giving a total of \( n = 9 \) distinct digits. Notice that \( 0 \) is not in the list, so there is no risk of placing \( 0 \) in the leading position. — Reason: Knowing the pool size tells us the starting value of \( n \) for the permutation formula.
  2. Step 2: A 4-digit number has four positions: thousands, hundreds, tens, and units, so \( r = 4 \). We need to count all ways to choose and arrange \( 4 \) digits out of \( 9 \) without repetition. — Reason: Identifying \( r \) lets us set up the permutation calculation correctly.
  3. Step 3: Apply the Fundamental Principle of Counting position by position. Thousands place: \( 9 \) choices. Hundreds place: one digit is used, so \( 8 \) choices remain. Tens place: two digits are used, so \( 7 \) choices remain. Units place: three digits are used, so \( 6 \) choices remain. — Reason: Each selection removes one digit from the pool, which is exactly what 'no repetition' means.
  4. Step 4: Multiply all choices together using the Fundamental Principle: \[ 9 \times 8 \times 7 \times 6 \] — Reason: Independent sequential choices are multiplied to get the total number of arrangements.
  5. Step 5: Verify using the permutation formula with \( n = 9 \) and \( r = 4 \): \[ {}^{9}P_{4} = \frac{9!}{(9-4)!} = \frac{9!}{5!} = 9 \times 8 \times 7 \times 6 \] — Reason: The formula confirms the step-by-step counting method gives the same expression.
  6. Step 6: Evaluate the product step by step. First, \( 9 \times 8 = 72 \). Then, \( 72 \times 7 = 504 \). Finally, \( 504 \times 6 = 3024 \). — Reason: Breaking the multiplication into smaller parts avoids arithmetic errors.

Final Answer

The number of 4-digit numbers that can be formed is \( 3024 \).

Common Mistake

One common mistake: students sometimes include \( 0 \) in the digit list (treating it as one of 10 digits) and then subtract cases where \( 0 \) appears in the thousands place — but the problem clearly states the digits are \( 1 \) through \( 9 \), so \( 0 \) is never available and no such adjustment is needed.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Available digits: \( 1, 2, 3, 4, 5, 6, 7, 8, 9 \), so \( n = 9 \), \( r = 4 \), no repetition allowed.
  2. Step 2: Choices per position (thousands \( \times \) hundreds \( \times \) tens \( \times \) units): \( 9 \times 8 \times 7 \times 6 \)
  3. Step 3: \[ {}^{9}P_{4} = \frac{9!}{(9-4)!} = \frac{9!}{5!} = 9 \times 8 \times 7 \times 6 = 3024 \]

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

➕ More Examples

More Examples

Example 1

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

Solution: We have 6 distinct digits: 2, 3, 5, 6, 7, 8. We need to form 3-digit numbers without repeating any digit. For the hundreds place, we can choose any of the 6 digits. So the number of choices for the hundreds place is 6. After filling the hundreds place, 5 digits remain. So the number of choices for the tens place is 5. After filling the tens place, 4 digits remain. So the number of choices for the units place is 4. By the Fundamental Principle of Counting, the total number of 3-digit numbers is: \[ 6 \times 5 \times 4 \] This is the same as \( {}^{6}P_{3} \). Computing: \[ {}^{6}P_{3} = \frac{6!}{(6-3)!} = \frac{6!}{3!} = \frac{720}{6} = 120 \] Therefore, 120 three-digit numbers can be formed.

Answer: 120

Example 2

Question: How many 5-digit numbers can be formed using the digits 1, 2, 3, 4, 5, 6, and 7, if no digit is repeated?

Solution: We have 7 distinct digits: 1, 2, 3, 4, 5, 6, 7. We need to form 5-digit numbers without repeating any digit. We must fill 5 positions (ten-thousands, thousands, hundreds, tens, units). For the first (leftmost) position, there are 7 choices. For the second position, 6 digits remain, so there are 6 choices. For the third position, 5 digits remain, so there are 5 choices. For the fourth position, 4 digits remain, so there are 4 choices. For the fifth position, 3 digits remain, so there are 3 choices. By the Fundamental Principle of Counting, the total number of 5-digit numbers is: \[ 7 \times 6 \times 5 \times 4 \times 3 \] This equals \( {}^{7}P_{5} \). Computing step by step: \[ {}^{7}P_{5} = \frac{7!}{(7-5)!} = \frac{7!}{2!} \] \[ = \frac{5040}{2} = 2520 \] Therefore, 2520 five-digit numbers can be formed.

Answer: 2520

🎯 Try a Similar Question

Try a Similar Question

Question: How many 3-digit numbers can be formed using the digits 2 to 8 (i.e., from the set \{2, 3, 4, 5, 6, 7, 8\}), if repetition of digits is not allowed?

Solution

  1. Step 1: Identify the available digits and the task: The available digits are \( \{2, 3, 4, 5, 6, 7, 8\} \), which gives us a total of \( n = 7 \) distinct digits. We need to form 3-digit numbers, so we must choose and arrange \( r = 3 \) digits from these 7, without repetition.
  2. Step 2: Check for leading-zero issues: Since none of the digits in our set is 0, every arrangement of 3 digits from this set will automatically form a valid 3-digit number. No special case needs to be handled.
  3. Step 3: Apply the Permutation Formula: The number of 3-digit numbers is the number of permutations of 7 digits taken 3 at a time, given by \( {}^{7}P_{3} \). Using the formula: \[ {}^{7}P_{3} = \frac{7!}{(7 - 3)!} = \frac{7!}{4!} \]
  4. Step 4: Simplify the factorial expression: Expanding the numerator partially: \[ \frac{7!}{4!} = \frac{7 \times 6 \times 5 \times 4!}{4!} = 7 \times 6 \times 5 \] Calculating: \[ 7 \times 6 = 42 \] and then \[ 42 \times 5 = 210 \]
  5. Step 5: State the final answer: Therefore, the total number of 3-digit numbers that can be formed is \( {}^{7}P_{3} = 210 \).

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

Everything you get with Solver7

More questions in Permutations and Combinations