How many four digit numbers, which are divisible by 6, can be formed using the digits 0, 2, 3, 4, 6, such that no digit is used more than once and 0 does not occur in the left-most position?
Show solution
Correct answer: 50
Think of this as: first lock in divisibility by 3 (which digits we pick), then lock in divisibility by 2 (where the even digit sits), all while keeping 0 out of the lead.
Step 1 — What does divisibility by 6 require?
A number is divisible by 6 if and only if it is divisible by both 2 and 3:
- Divisible by 2 → the last digit must be even (0, 2, 4, or 6).
- Divisible by 3 → the sum of all four digits must be a multiple of 3.
We also have two structural rules: no digit repeats, and the first digit cannot be 0.
Step 2 — Find which 4-digit sets have a digit-sum that's a multiple of 3.
We choose 4 digits from . The sum of all five available digits is:
Since 15 is divisible by 3, dropping one digit leaves a sum divisible by 3 if and only if the dropped digit is itself divisible by 3.
💡 Teacher tip: This is modular arithmetic in disguise. If the total is , then requires . So the dropped digit must be a multiple of 3.
Among , the multiples of 3 are 0, 3, and 6. Dropping 2 (leaving sum 13) or 4 (leaving sum 11) would break divisibility by 3, so those sets are discarded.
| Dropped digit | Remaining 4 digits | Digit sum | Divisible by 3? |
|---|---|---|---|
| 0 | 15 | ✓ | |
| 3 | 12 | ✓ | |
| 6 | 9 | ✓ |
Only three 4-digit sets can possibly work. Now we count valid arrangements for each.
Step 3 — Count valid 4-digit numbers for each set.
For every set: last digit must be even, first digit cannot be 0, no repeats.
Set A: — contains no 0, so the leading-zero constraint is automatically satisfied.
- Last digit (must be even): 2, 4, or 6 → 3 choices.
- First three positions: arrange the remaining 3 digits → ways.
- Count: .
Set B: — all four digits are even, so every arrangement automatically ends in an even digit. The only constraint is no leading 0.
- First digit (cannot be 0): 2, 4, or 6 → 3 choices.
- Remaining three positions: arrange the other 3 digits → ways.
- Count: .
Set C: — last digit must be even (0, 2, or 4), and first digit cannot be 0. We split by the last digit:
| Last digit | Choices for first digit (cannot be 0) | Middle two digits | Count |
|---|---|---|---|
| 0 | → 3 | ||
| 2 | → 2 | ||
| 4 | → 2 |
- Count: .
💡 Teacher tip: When 0 is in the set, always handle the last-digit cases separately. If the last digit is 0, the leading-zero constraint is easy — any of the remaining non-zero digits can lead. If the last digit is a non-zero even digit, then 0 is still in the pool for the middle positions but must be excluded from the first position.
Step 4 — Add the counts.
Answer: 50
Why this works cleanly: The sum of all five available digits being 15 (a multiple of 3) is the key break — it means divisibility by 3 reduces to a simple test on the dropped digit, instantly narrowing five candidate sets down to three.
Alternative approach (cross-check by fixing the last digit).
Instead of grouping by digit-set, fix the last digit (must be even: 0, 2, 4, or 6), then choose 3 more digits from the remaining four so that the total sum is divisible by 3, and count arrangements with no leading 0.
For each last digit, we need the sum of the first three digits to satisfy a specific remainder mod 3 (so that total ≡ 0 mod 3). We list the valid 3-digit subsets and count arrangements (subtracting those with leading 0 when 0 is in the subset):
| Last digit | Available for first 3 | Needed sum mod 3 | Valid subsets (arrangements) | Count |
|---|---|---|---|---|
| 0 | 0 | , | 12 | |
| 2 | 1 | , , | 14 | |
| 4 | 2 | , , | 14 | |
| 6 | 0 | , | 10 |
(Each subset with no 0 gives arrangements; each subset containing 0 gives valid arrangements after removing those with leading 0.)
Total: ✓ — same answer, confirming the count.