SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 6 Q5

How many \(6\)-digit numbers can be formed from the digits \(0, 1, 3, 5,7\) and \(9\) which are divisible by \(10\) and no digit is repeated \(?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have six number cards: 0, 1, 3, 5, 7, and 9. You want to arrange all six cards in a row to make a big number. The last card must always be 0, because only numbers ending in 0 can be divided evenly by 10. So 0 is locked at the end. The other five cards can be shuffled around freely in any order. There are \(5 \times 4 \times 3 \times 2 \times 1 = 120\) ways to do that shuffling.

Answer: There are \(120\) such 6-digit numbers.

📖 Forming 6-Digit Numbers Divisible by 10

Detailed Explanation

A number is divisible by \(10\) exactly when its last digit (units place) is \(0\). So the fixed condition here is that the units place must be \(0\). We are given the digits \(0, 1, 3, 5, 7, 9\), which is \(6\) distinct digits, and we must form 6-digit numbers using each digit at most once (no repetition). Since we have exactly \(6\) digits and need \(6\) places, every digit will be used exactly once. The key idea is the Fundamental Principle of Counting: if one task can be done in \(m\) ways and a following task in \(n\) ways, the two together can be done in \(m \times n\) ways. We fill the most restricted position (the units place) first, then count the ways to arrange the remaining digits in the other places.

Formula Used

Number of arrangements of \(n\) distinct objects in \(n\) places is \(n! = n \times (n-1) \times \cdots \times 1\). Fundamental Principle of Counting: total ways \( = m \times n\).

Solution

  1. Step 1: For a number to be divisible by \(10\), its units digit must be \(0\). Among the given digits \(0, 1, 3, 5, 7, 9\), only \(0\) can occupy the units place. So the units place can be filled in exactly \(1\) way.
  2. Step 2: After placing \(0\) in the units place, the remaining \(5\) distinct digits are \(1, 3, 5, 7, 9\). These must fill the remaining \(5\) positions (lakhs, ten-thousands, thousands, hundreds, tens). Since \(0\) is already used and is not the leading digit, there is no risk of the number starting with \(0\), so all \(5\) remaining digits are freely arrangeable.
  3. Step 3: The number of ways to arrange these \(5\) different digits in \(5\) places is \[5! = 5 \times 4 \times 3 \times 2 \times 1 = 120.\]
  4. Step 4: By the Fundamental Principle of Counting, multiply the choices: units place ways \(\times\) arrangement ways. \[1 \times 120 = 120.\]

Final Answer

There are \(120\) such 6-digit numbers.

Common Mistake

A common mistake is to worry about the leading digit not being \(0\) and subtract cases, or to compute \(6!\). Here \(0\) is forced into the units place, so it can never be the first digit, and only the remaining \(5\) digits are arranged, giving \(5! = 120\), not \(6! = 720\).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the digits and the constraint: We are given 6 distinct digits: \(0, 1, 3, 5, 7, 9\). We need to form 6-digit numbers using each digit exactly once (since there are exactly 6 digits for 6 places). — Reason: Knowing the available digits and the no-repetition rule tells us the total pool we are working with.
  2. Step 2: Apply the divisibility rule for 10: A number is divisible by \(10\) if and only if its units digit is \(0\). Among the given digits, only \(0\) qualifies. So the units place can be filled in exactly \(1\) way. — Reason: Fixing the most restricted position first simplifies all subsequent counting.
  3. Step 3: Count the choices for the remaining 5 positions: After placing \(0\) in the units place, the remaining digits are \(1, 3, 5, 7, 9\) — all five are non-zero. These 5 digits must fill the remaining 5 positions (ten-thousands, thousands, hundreds, tens, and the leading lakhs place). Because none of the leftover digits is \(0\), every arrangement automatically produces a valid 6-digit number (no leading-zero issue). — Reason: Confirming no leading-zero risk means we can freely arrange all 5 remaining digits without extra restrictions.
  4. Step 4: Compute the number of arrangements of the remaining digits: The 5 remaining distinct digits can be arranged in \(5!\) ways. \[5! = 5 \times 4 \times 3 \times 2 \times 1 = 120\] — Reason: Each of the 5 positions can be filled with any of the unused digits, and the Fundamental Principle of Counting gives the product of choices at each stage.
  5. Step 5: Apply the Fundamental Principle to get the total: Total 6-digit numbers divisible by \(10\) = (ways to fill units place) \(\times\) (ways to arrange remaining digits) \[= 1 \times 5! = 1 \times 120 = 120\] — Reason: Multiplying across all positions (using the Fundamental Principle) gives the overall count of valid numbers.

Final Answer

There are \(120\) such 6-digit numbers.

Common Mistake

One common mistake: Students sometimes treat 0 like any other digit and place it freely in all 6 positions, then subtract cases where 0 appears at the front — this round-about method is error-prone. Instead, directly fix 0 in the units place (the only valid spot for divisibility by 10) and arrange the rest, which is both faster and avoids over-counting.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Divisibility by 10 requires units digit \( = 0 \). Units place: \( 1 \) way.
  2. Step 2: Remaining digits \( \{1, 3, 5, 7, 9\} \) fill the remaining 5 places: \( 5! = 120 \) ways.
  3. Step 3: Total \( = 1 \times 5! = 1 \times 120 = 120 \).

Answer: There are \(120\) such 6-digit numbers.

➕ More Examples

More Examples

Example 1

Question: How many 5-digit numbers can be formed using the digits 0, 2, 4, 6 and 8, if each digit is used exactly once and the number is divisible by 10?

Solution: For a number to be divisible by 10, its units digit must be 0. Step 1: Fix 0 at the units place. The units digit is fixed as 0. Remaining digits available: 2, 4, 6, 8 (four digits). Remaining places to fill: ten-thousands, thousands, hundreds, tens (four places). Step 2: The leading (ten-thousands) digit cannot be 0. Since 0 is already used, all 4 remaining digits (2, 4, 6, 8) are non-zero, so any of them can be placed in the ten-thousands place. Number of choices for ten-thousands place: 4. Step 3: The remaining 3 digits can be arranged in the remaining 3 places (thousands, hundreds, tens) in \( 3! \) ways. \[ 3! = 6 \] Step 4: Total number of 5-digit numbers divisible by 10: \[ 4 \times 3! = 4 \times 6 = 24 \]

Answer: 24

Example 2

Question: How many 7-digit numbers can be formed using the digits 0, 1, 2, 3, 4, 5 and 6, if each digit is used exactly once and the number is divisible by 10?

Solution: For a number to be divisible by 10, its units digit must be 0. Step 1: Fix 0 at the units place. The units digit is fixed as 0. Remaining digits available: 1, 2, 3, 4, 5, 6 (six digits). Remaining places to fill: the leftmost 6 places (millions, hundred-thousands, ten-thousands, thousands, hundreds, tens). Step 2: The leading (millions) digit cannot be 0. Since 0 is already placed at units, all 6 remaining digits are non-zero, so any of them can fill the leading place. Number of choices for the leading place: 6. Step 3: The remaining 5 digits can be arranged in the remaining 5 places in \( 5! \) ways. \[ 5! = 120 \] Step 4: Total number of 7-digit numbers divisible by 10: \[ 6 \times 5! = 6 \times 120 = 720 \]

Answer: 720

🎯 Try a Similar Question

Try a Similar Question

Question: How many 7-digit numbers can be formed using the digits \( 0, 2, 3, 4, 6, 7, 8 \) (without repetition) that are divisible by 10?

Solution

  1. Step 1: Understand the divisibility condition: A number is divisible by 10 if and only if its units (last) digit is 0. Since 0 is one of our available digits, we fix 0 in the units place. This uses up 1 digit, leaving 6 remaining digits: \( 2, 3, 4, 6, 7, 8 \).
  2. Step 2: Identify the remaining positions: We now need to fill 6 positions (the first 6 places of the 7-digit number) using the 6 remaining digits \( 2, 3, 4, 6, 7, 8 \), each used exactly once.
  3. Step 3: Check the leading digit constraint: Since none of the remaining digits \( \{2, 3, 4, 6, 7, 8\} \) is 0, any of them can occupy the leading (leftmost) position without making it an invalid number (no leading zero issue). So there is no additional restriction on the first position.
  4. Step 4: Count the arrangements: The 6 remaining digits can be arranged in the 6 remaining positions in \( 6! \) ways. We compute: \[ 6! = 6 \times 5 \times 4 \times 3 \times 2 \times 1 = 720 \]
  5. Step 5: State the final count: Since the units digit is fixed as 0 (1 way) and the remaining 6 digits fill the other 6 positions in \( 6! \) ways, the total number of valid 7-digit numbers is \[ 1 \times 6! = 720 \]

Answer: There are \( 720 \) such 7-digit numbers.

Everything you get with Solver7

More questions in Permutations and Combinations