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