SOLVER7 Study. Nothing Else.
Exercise 6.3 Q1

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

Solution

👶 Simple Explanation

Simple Explanation

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

📖 Forming 3-Digit Numbers Without Repetition

Detailed Explanation

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.

Formula Used

Number of arrangements \( = {}^{9}P_{3} = \frac{9!}{(9-3)!} \) OR by the multiplication principle: \( 9 \times 8 \times 7 \).

Solution

  1. Step 1: Identify the available digits and the places to fill. The digits available are \( 1, 2, 3, 4, 5, 6, 7, 8, 9 \), giving 9 digits in total. A 3-digit number has three positions to fill: the hundreds place, the tens place, and the units place.
  2. Step 2: Fill the hundreds place. Any of the 9 digits can be chosen for the hundreds place, so there are \( 9 \) choices. Note that \( 0 \) is not in our set, so no digit is disallowed here.
  3. Step 3: Fill the tens place. Since no digit can be repeated, one digit has already been used in the hundreds place. This leaves \( 8 \) digits available, so there are \( 8 \) choices for the tens place.
  4. Step 4: Fill the units place. Now two digits have been used, so \( 7 \) digits remain. Hence there are \( 7 \) choices for the units place.
  5. Step 5: Apply the Fundamental Principle of Counting by multiplying the choices for each place: \[ 9 \times 8 \times 7 = 504 \] This is the same as computing \( {}^{9}P_{3} = \frac{9!}{6!} = 9 \times 8 \times 7 = 504 \).

Final Answer

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

Common Mistake

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

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the available digits and the positions to fill: The digits available are \( 1, 2, 3, 4, 5, 6, 7, 8, 9 \), which gives us \( 9 \) digits in total. A 3-digit number has three positions: the hundreds place, the tens place, and the units place. — Reason: Clearly listing the digit set and the number of positions helps us apply the counting principle correctly.
  2. Step 2: Count choices for the hundreds place: Any of the \( 9 \) available digits can occupy the hundreds place, so there are \( 9 \) choices. Since \( 0 \) is not in our digit set, every choice here gives a valid 3-digit number. — Reason: We start from the leftmost position and count freely since all 9 digits are still unused.
  3. Step 3: Count choices for the tens place: After placing one digit in the hundreds place, that digit cannot be reused. This leaves \( 9 - 1 = 8 \) digits available for the tens place, giving \( 8 \) choices. — Reason: The no-repetition condition reduces the pool by one digit for each position filled.
  4. Step 4: Count choices for the units place: Two digits have now been used (one in each of the first two positions). The units place can be filled with any of the remaining \( 9 - 2 = 7 \) digits, giving \( 7 \) choices. — Reason: Each position used reduces the available digits by one, continuing to enforce the no-repetition rule.
  5. Step 5: Apply the Fundamental Principle of Counting: Since the three choices are made one after another (and each choice is independent of the others given the selections already made), we multiply the number of choices at each stage: \[9 \times 8 \times 7 = 504\] This is equivalent to the permutation \( {}^{9}P_{3} = \dfrac{9!}{(9-3)!} = \dfrac{9!}{6!} = 9 \times 8 \times 7 = 504 \). — Reason: The multiplication principle states that if successive independent choices can be made in \( m \), \( n \), and \( p \) ways respectively, the total number of outcomes is \( m \times n \times p \).

Final Answer

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

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Digits available: \( 1, 2, 3, 4, 5, 6, 7, 8, 9 \) (9 digits, no repetition allowed)
  2. Step 2: Choices: Hundreds place \( = 9 \), Tens place \( = 8 \), Units place \( = 7 \)
  3. Step 3: Total \( = 9 \times 8 \times 7 = 504 \)

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

➕ More Examples

More Examples

Example 1

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.

Example 2

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.

🎯 Try a Similar Question

Try a Similar Question

Question: How many 4-digit numbers can be formed by using the digits 1 to 8, if no digit is repeated?

Solution

  1. Step 1: Identify the available digits and the requirement: The available digits are 1, 2, 3, 4, 5, 6, 7, 8 — a total of \( n = 8 \) distinct digits. We need to form 4-digit numbers, so we choose and arrange \( r = 4 \) digits at a time, with no repetition allowed.
  2. Step 2: Check for leading-zero issues: Since the digits available are 1 through 8 (zero is excluded), every arrangement of 4 digits will automatically give a valid 4-digit number. There is no risk of a leading zero.
  3. Step 3: Apply the permutation formula: The number of 4-digit numbers is given by \( {}^{8}P_{4} \), which equals \[ {}^{8}P_{4} = \frac{8!}{(8-4)!} = \frac{8!}{4!} \]
  4. Step 4: Expand and simplify: Expanding the numerator down to the point where it cancels with the denominator: \[ \frac{8!}{4!} = \frac{8 \times 7 \times 6 \times 5 \times 4!}{4!} = 8 \times 7 \times 6 \times 5 \] Calculating step by step: \( 8 \times 7 = 56 \), then \( 56 \times 6 = 336 \), then \( 336 \times 5 = 1680 \).
  5. Step 5: State the final answer: Therefore, the total number of 4-digit numbers that can be formed is \[ {}^{8}P_{4} = 1680 \]

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

Everything you get with Solver7

More questions in Permutations and Combinations