SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 14 Q9(ii)

If \(4\)-digit numbers greater than \(5,000\) are randomly formed from the digits \(0,1,3,5,\) and \(7,\) what is the probability of forming a number divisible by \(5\) when, the repetition of digits is not allowed\(?\)

CBSE Class 11 Maths · Probability

Solution

👶 Simple Explanation

Simple Explanation

Imagine picking tiles with digits 0, 1, 3, 5, 7 to make a 4-digit number bigger than 5000. Only 48 such numbers are possible. A number ends in 0 or 5 to be divisible by 5. Out of those 48 numbers, exactly 18 end in 0 or 5. So the chance of picking one of those lucky numbers is 18 out of 48, which simplifies to 3 out of 8. Think of it like drawing a winning card from a small deck.

Answer: The probability of forming a number divisible by 5 is \( \dfrac{3}{8} \).

📖 Probability of a 4-Digit Number Greater Than 5000 Divisible by 5

Detailed Explanation

We are forming 4-digit numbers from the digits \( 0, 1, 3, 5, 7 \) with no repetition allowed. The number must be greater than 5000. Since it is a 4-digit number, the thousands place cannot be 0, and to be greater than 5000, the thousands digit must be 5 or 7 (the only available digits that are 5 or more). To count favourable cases, we also need the number to be divisible by 5, which means the units (last) digit must be 0 or 5. Probability here is classical: \[ P(E) = \frac{\text{number of favourable outcomes}}{\text{total number of outcomes}} \]

Formula Used

\[ P(E) = \frac{\text{Number of favourable outcomes}}{\text{Total number of outcomes}} \]

Solution

  1. Step 1: Count the total outcomes (all 4-digit numbers greater than 5000). The thousands place must be greater than or equal to 5, so it can be 5 or 7. That gives \( 2 \) choices for the first digit.
  2. Step 2: For the remaining three places, we choose from the leftover 4 digits with no repetition. The number of ways to arrange 3 of the remaining 4 digits is \( {}^{4}P_{3} = 4 \times 3 \times 2 = 24 \).
  3. Step 3: Total outcomes = (choices for thousands digit) \( \times \) (arrangements of remaining digits): \[ 2 \times 24 = 48 \] So the total number of 4-digit numbers greater than 5000 is \( 48 \).
  4. Step 4: Now count favourable outcomes (divisible by 5). For divisibility by 5, the units digit must be 0 or 5. We handle two cases based on the units digit, keeping the thousands digit as 5 or 7.
  5. Step 5: Case A: units digit is 0. Then the thousands digit can be 5 or 7 (2 choices). The two middle places are filled from the remaining 3 digits: \( {}^{3}P_{2} = 3 \times 2 = 6 \). Numbers in this case: \[ 2 \times 6 = 12 \]
  6. Step 6: Case B: units digit is 5. Then 5 is used at the end, so the thousands digit cannot be 5; it must be 7 (1 choice). The two middle places are filled from the remaining 3 digits (which are 0, 1, 3): \( {}^{3}P_{2} = 6 \). Numbers in this case: \[ 1 \times 6 = 6 \]
  7. Step 7: Total favourable outcomes = Case A + Case B: \[ 12 + 6 = 18 \]
  8. Step 8: Apply the probability formula: \[ P(E) = \frac{18}{48} = \frac{3}{8} \]

Final Answer

The probability of forming a number divisible by 5 is \( \dfrac{3}{8} \).

Common Mistake

A frequent error in Case B is forgetting that once 5 is placed in the units position, it cannot also be the thousands digit, so the thousands digit must be 7 (not 5 or 7). Miscounting this leads to a wrong favourable count.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the digit set and constraints: Available digits: \( \{0, 1, 3, 5, 7\} \) — no repetition allowed. For the number to be a 4-digit number greater than 5000, the thousands digit must be at least 5. From the available digits, only \( 5 \) and \( 7 \) satisfy this, giving \( 2 \) choices for the thousands place. Reason: The thousands digit determines whether the number is greater than 5000, and it cannot be 0 (otherwise it would not be a 4-digit number).
  2. Step 2: Count total outcomes (numbers greater than 5000): After fixing the thousands digit (2 choices), 4 digits remain for the other three places. The number of ways to fill the hundreds, tens, and units places is \( {}^{4}P_{3} = 4 \times 3 \times 2 = 24 \). So the total count is \[ 2 \times 24 = 48 \] Reason: We use the multiplication principle — the choices for each position multiply together to give all possible arrangements.
  3. Step 3: Set up favourable cases (divisible by 5): A number is divisible by 5 if and only if its units digit is \( 0 \) or \( 5 \). We split the count into two cases based on the units digit. Reason: Splitting into cases avoids double-counting and keeps track of whether \( 5 \) is used at the units place or the thousands place.
  4. Step 4: Case A — Units digit is 0: Units digit fixed at \( 0 \). Thousands digit can still be \( 5 \) or \( 7 \): \( 2 \) choices. The two middle places (hundreds and tens) are filled from the remaining 3 digits in \( 3 \times 2 = 6 \) ways. Count for Case A: \[ 2 \times 6 = 12 \] Reason: When the units digit is 0, it is no longer available for any other position, so only 3 digits remain for the interior positions.
  5. Step 5: Case B — Units digit is 5: Units digit fixed at \( 5 \). Now 5 is used, so the thousands digit can only be \( 7 \) (the only remaining digit \( \ge 5 \)): \( 1 \) choice. The two middle places are filled from the remaining 3 digits in \( 3 \times 2 = 6 \) ways. Count for Case B: \[ 1 \times 6 = 6 \] Reason: Since 5 is already at the units place, it cannot also be the thousands digit, leaving only 7 as a valid thousands digit.
  6. Step 6: Total favourable outcomes: Adding both cases: \[ 12 + 6 = 18 \] Reason: Case A and Case B are mutually exclusive (units digit is either 0 or 5, not both), so we simply add the two counts.
  7. Step 7: Calculate the probability: Applying the classical probability formula: \[ P(E) = \frac{18}{48} = \frac{3}{8} \] Reason: We divide the number of favourable outcomes by the total number of outcomes and simplify the fraction by dividing numerator and denominator by 6.

Final Answer

The probability of forming a number divisible by 5 is \( \dfrac{3}{8} \).

Common Mistake

One common mistake: Students forget that when the units digit is 5, the digit 5 is no longer available for the thousands place — they incorrectly allow 2 choices (5 or 7) for the thousands digit in Case B, which leads to an overcounted and wrong answer.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Total outcomes: Thousands digit ∈ {5, 7} (2 choices); remaining 3 places filled from leftover 4 digits:     Total =     \[2 \times {}^{4}P_{3} = 2 \times 24 = 48\]
  2. Step 2: Favourable outcomes (units digit = 0 or 5): Case A — Units digit = 0: thousands digit ∈ {5, 7} (2 choices), middle 2 places from remaining 3 digits: \[2 \times {}^{3}P_{2} = 2 \times 6 = 12\] Case B — Units digit = 5: thousands digit must be 7 only (1 choice, since 5 is used), middle 2 places from remaining 3 digits: \[1 \times {}^{3}P_{2} = 1 \times 6 = 6\] Favourable = \(12 + 6 = 18\)
  3. Step 3: Probability: \[P(E) = \frac{18}{48} = \frac{3}{8}\]

Answer: The probability of forming a number divisible by 5 is \( \dfrac{3}{8} \).

➕ More Examples

More Examples

Example 1

Question: 5-digit numbers greater than 60,000 are randomly formed from the digits 0, 2, 4, 6, and 8 without repetition. What is the probability that a randomly chosen such number is divisible by 4?

Solution: We are forming 5-digit numbers from the digits \( \{0, 2, 4, 6, 8\} \) without repetition, and the number must be greater than 60,000. Step 1: Count the total number of 5-digit numbers greater than 60,000. For the number to exceed 60,000, the leading (ten-thousands) digit must be 6 or 8. Case A: First digit = 6. The remaining 4 positions are filled with the 4 remaining digits in \( 4! = 24 \) ways. Case B: First digit = 8. Similarly, \( 4! = 24 \) ways. Total = \[ 24 + 24 = 48 \] Step 2: Count 5-digit numbers greater than 60,000 that are divisible by 4. A number is divisible by 4 if its last two digits form a number divisible by 4. We need to find all 2-digit endings from \( \{0, 2, 4, 6, 8\} \) (with all digits distinct) that are divisible by 4. Possible 2-digit endings (tens digit, units digit) divisible by 4, with both digits from \( \{0, 2, 4, 6, 8\} \) and distinct: \( 04, 08, 20, 24, 28, 40, 48, 60, 64, 68, 80, 84 \) Checking each: 04 \( \div \) 4 = 1 ✓, 08 \( \div \) 4 = 2 ✓, 20 \( \div \) 4 = 5 ✓, 24 \( \div \) 4 = 6 ✓, 28 \( \div \) 4 = 7 ✓, 40 \( \div \) 4 = 10 ✓, 48 \( \div \) 4 = 12 ✓, 60 \( \div \) 4 = 15 ✓, 64 \( \div \) 4 = 16 ✓, 68 \( \div \) 4 = 17 ✓, 80 \( \div \) 4 = 20 ✓, 84 \( \div \) 4 = 21 ✓. All 12 endings are valid. Now, for each valid ending, count the numbers greater than 60,000. For each 2-digit ending (using 2 specific digits), the remaining 3 digits (from the 3 unused digits) are arranged in the first three positions, but the first digit must be 6 or 8. For each ending pair \( (d_4, d_5) \), the remaining 3 digits fill positions 1, 2, 3. The first digit must be 6 or 8 (and not already used in the ending). Let us go through cases by first digit: Case A — First digit = 6: The last two digits must be chosen from the remaining 4 digits \( \{0, 2, 4, 8\} \) (since 6 is used at front). Valid endings from \( \{0,2,4,8\} \) divisible by 4: \( 04, 08, 20, 24, 28, 40, 48, 80, 84 \) Checking: 04 ✓, 08 ✓, 20 ✓, 24 ✓, 28 ✓, 40 ✓, 48 ✓, 80 ✓, 84 ✓ — that gives 9 valid endings. For each, the middle 2 positions (positions 2 and 3) are filled with the remaining 2 digits in \( 2! = 2 \) ways. Subtotal: \( 9 \times 2 = 18 \) Case B — First digit = 8: Remaining 4 digits: \( \{0, 2, 4, 6\} \). Valid endings from \( \{0,2,4,6\} \) divisible by 4: \( 04, 20, 24, 40, 60, 64 \) Checking: 04 ✓, 20 ✓, 24 ✓, 40 ✓, 60 ✓, 64 ✓ — that gives 6 valid endings. For each, \( 2! = 2 \) arrangements for positions 2 and 3. Subtotal: \( 6 \times 2 = 12 \) Favourable outcomes = \[ 18 + 12 = 30 \] Step 3: Probability \[ P = \frac{30}{48} = \frac{5}{8} \]

Answer: \( \dfrac{5}{8} \)

Example 2

Question: 4-digit numbers greater than 3,000 are randomly formed from the digits 0, 1, 3, 6, and 9 without repetition. What is the probability that a randomly chosen such number is divisible by 3?

Solution: We form 4-digit numbers from \( \{0, 1, 3, 6, 9\} \) without repetition, greater than 3,000. Step 1: Count total 4-digit numbers greater than 3,000. The leading digit must be 3, 6, or 9 (i.e., at least 3, and not 0 or 1). Case A: First digit = 3. Remaining 3 positions filled with 3 of the remaining 4 digits: \( 4 \times 3 \times 2 = 24 \) ways... but more precisely, we choose and arrange 3 digits from the remaining 4: \( {}^{4}P_{3} = 24 \). Case B: First digit = 6. Similarly \( {}^{4}P_{3} = 24 \). Case C: First digit = 9. Similarly \( {}^{4}P_{3} = 24 \). Total = \[ 24 + 24 + 24 = 72 \] Step 2: Count those divisible by 3. A number is divisible by 3 if the sum of its digits is divisible by 3. We choose 4 digits from \( \{0, 1, 3, 6, 9\} \) (without repetition) such that their sum is divisible by 3, and then arrange them with the constraint that the first digit is from \( \{3, 6, 9\} \). The sum of all 5 digits: \( 0 + 1 + 3 + 6 + 9 = 19 \). We leave out one digit and use the remaining 4. The sum of the 4 chosen digits = \( 19 - (\text{excluded digit}) \). For divisibility by 3, we need \( 19 - d \equiv 0 \pmod{3} \), i.e., \( d \equiv 19 \equiv 1 \pmod{3} \). Digits with remainder 1 when divided by 3: from \( \{0,1,3,6,9\} \), we check: \( 0 \equiv 0 \), \( 1 \equiv 1 \), \( 3 \equiv 0 \), \( 6 \equiv 0 \), \( 9 \equiv 0 \pmod{3} \). Only digit \( 1 \) satisfies \( d \equiv 1 \pmod{3} \). So the excluded digit must be 1, and the 4 chosen digits are \( \{0, 3, 6, 9\} \). Sum check: \( 0 + 3 + 6 + 9 = 18 \), and \( 18 \div 3 = 6 \) ✓. Now count 4-digit arrangements of \( \{0, 3, 6, 9\} \) that are greater than 3,000 (i.e., first digit \( \ge 3 \)). Since 0 cannot be the first digit and all of 3, 6, 9 satisfy the "greater than 3,000" condition as leading digits: First digit can be 3, 6, or 9 (3 choices). The remaining 3 positions are filled with the remaining 3 digits in \( 3! = 6 \) ways. Favourable outcomes = \[ 3 \times 6 = 18 \] Step 3: Probability \[ P = \frac{18}{72} = \frac{1}{4} \]

Answer: \( \dfrac{1}{4} \)

🎯 Try a Similar Question

Try a Similar Question

Question: 4-digit numbers greater than 6000 are randomly formed from the digits 0, 2, 4, 6, and 8, without repetition of digits. What is the probability that a number so formed is divisible by 4?

Solution

  1. Step 1: Identify valid leading digits: Since the 4-digit number must be greater than 6000 and is formed from \( \{0, 2, 4, 6, 8\} \) without repetition, the thousands digit can only be 6 or 8 (both are greater than 6000 when placed first; note that a number starting with 6 is exactly in the 6000s and is greater than 6000 as long as the remaining digits are not all zero, which they cannot be since all digits are distinct and 0 appears at most once).
  2. Step 2: Count total valid 4-digit numbers: Case 1 — Thousands digit is 6: The remaining 3 digits are chosen from \( \{0, 2, 4, 8\} \) (4 digits) and arranged in 3 places. Number of such numbers \( = 4 \times 3 \times 2 = 24 \). Case 2 — Thousands digit is 8: The remaining 3 digits are chosen from \( \{0, 2, 4, 6\} \) (4 digits). Number of such numbers \( = 4 \times 3 \times 2 = 24 \). Total number of valid 4-digit numbers \( = 24 + 24 = 48 \).
  3. Step 3: Divisibility rule for 4: A number is divisible by 4 if its last two digits form a number divisible by 4. We need to count how many of our 48 numbers have their last two digits (tens and units) forming a 2-digit number divisible by 4, using distinct digits from the available set, with the constraint that the thousands digit is already fixed.
  4. Step 4: List 2-digit endings from {0,2,4,6,8} divisible by 4: All 2-digit numbers using two distinct digits from \( \{0, 2, 4, 6, 8\} \) that are divisible by 4: 20, 24, 28, 40, 48, 60, 64, 68, 80, 84, 04 (i.e. 04 = 4, not a 2-digit ending in the usual sense — but as a tens-units pair (0,4) it gives the value 04 which is \( 4 \), divisible by 4), 08 (tens digit 0, units digit 8, value 8, divisible by 4), 40, 60, 80, 20, 04, 08, 24, 28, 48, 64, 68, 84. Let us list them systematically as ordered pairs (tens digit, units digit): (0,4), (0,8), (2,0), (2,4), (2,8), (4,0), (4,8), (6,0), (6,4), (6,8), (8,0), (8,4). That gives 12 ordered pairs.
  5. Step 5: Count favourable numbers with thousands digit = 6: Thousands digit is 6. The digits available for the remaining three positions are \( \{0, 2, 4, 8\} \). The last two digits must form a pair from our list of 12, using only digits from \( \{0, 2, 4, 8\} \) (since 6 is used). Valid (tens, units) pairs from \( \{0, 2, 4, 8\} \): (0,4), (0,8), (2,0), (2,4), (2,8), (4,0), (4,8), (8,0), (8,4). That is 9 pairs. For each such pair, the hundreds digit is one of the remaining 2 digits from \( \{0,2,4,8\} \) not used in the last two positions: 2 choices. Favourable numbers with thousands digit 6 \( = 9 \times 2 = 18 \).
  6. Step 6: Count favourable numbers with thousands digit = 8: Thousands digit is 8. Digits available for remaining positions: \( \{0, 2, 4, 6\} \). Valid (tens, units) pairs from \( \{0, 2, 4, 6\} \) that are divisible by 4: (0,4), (2,0), (2,4), (4,0), (6,0), (6,4). Check: (0,4)\(\to\)04=4 ✓, (2,0)\(\to\)20 ✓, (2,4)\(\to\)24 ✓, (4,0)\(\to\)40 ✓, (6,0)\(\to\)60 ✓, (6,4)\(\to\)64 ✓. Also check (0,?) with other digits: (0,2)=02=2 ✗, (0,6)=06=6 ✗. And (4,2)=42, 42÷4=10.5 ✗; (4,6)=46 ✗; (2,6)=26 ✗; (6,2)=62 ✗. So 6 valid pairs. For each pair, the hundreds digit is one of the remaining 2 digits from \( \{0,2,4,6\} \): 2 choices. Favourable numbers with thousands digit 8 \( = 6 \times 2 = 12 \).
  7. Step 7: Compute the probability: Total favourable numbers \( = 18 + 12 = 30 \). Total valid 4-digit numbers \( = 48 \). Therefore, the probability is \[ P = \frac{30}{48} = \frac{5}{8} \]

Answer: The probability that the 4-digit number formed is divisible by 4 is \( \dfrac{5}{8} \).

Everything you get with Solver7

More questions in Probability

Chapter 14 Examples Q1(i) Chapter 14 Examples Q1(ii) Chapter 14 Examples Q1(iii) Chapter 14 Examples Q1(iv) Chapter 14 Examples Q2 Chapter 14 Examples Q3 Chapter 14 Examples Q4 Chapter 14 Examples Q5(i) Chapter 14 Examples Q5(ii) Chapter 14 Examples Q5(iii) Chapter 14 Examples Q5(iv) Chapter 14 Examples Q5(v) Chapter 14 Examples Q6(i) Chapter 14 Examples Q6(ii) Chapter 14 Examples Q6(iii) Chapter 14 Examples Q6(iv) Chapter 14 Examples Q6(v) Chapter 14 Examples Q7(a) Chapter 14 Examples Q7(b) Chapter 14 Examples Q7(c) Chapter 14 Examples Q8(a) Chapter 14 Examples Q8(b) Chapter 14 Examples Q8(c) Chapter 14 Miscellaneous Examples Q9(i) Chapter 14 Miscellaneous Examples Q9(ii) Chapter 14 Miscellaneous Examples Q9(iii) Chapter 14 Miscellaneous Examples Q9(iv) Chapter 14 Miscellaneous Examples Q9(v) Chapter 14 Miscellaneous Examples Q10(i) Chapter 14 Miscellaneous Examples Q10(ii) Chapter 14 Miscellaneous Examples Q10(iii) Chapter 14 Miscellaneous Examples Q11 Chapter 14 Miscellaneous Examples Q12(a) Chapter 14 Miscellaneous Examples Q12(b) Exercise 14.1 Q1 Exercise 14.1 Q2 Exercise 14.1 Q3 Exercise 14.1 Q4(i) Exercise 14.1 Q4(ii) Exercise 14.1 Q4(iii) Exercise 14.1 Q5(i) Exercise 14.1 Q5(ii) Exercise 14.1 Q5(iii) Exercise 14.1 Q5(iv) Exercise 14.1 Q5(v) Exercise 14.1 Q6(i) Exercise 14.1 Q6(ii) Exercise 14.1 Q6(iii) Exercise 14.1 Q6(iv) Exercise 14.1 Q6(v) Exercise 14.1 Q6(vi) Exercise 14.1 Q6(vii) Exercise 14.1 Q6(viii) Exercise 14.1 Q7(i) Exercise 14.1 Q7(ii) Exercise 14.1 Q7(iii) Exercise 14.1 Q7(iv) Exercise 14.1 Q7(v) Exercise 14.1 Q7(vi) Exercise 14.2 Q1