What we want: the count of all integers strictly greater than 2000 that can be built from the digits {0,1,2,3,4,5} with no digit used more than once.
Step 1 — Decide which lengths can qualify.
Any number with 1, 2, or 3 digits is at most 999, which is below 2000. So only 4-digit, 5-digit, and 6-digit numbers can exceed 2000. We also cannot form 7-digit numbers since we only have 6 distinct digits available.
We count each length separately and add.
Step 2 — 4-digit numbers greater than 2000.
The thousands digit controls whether the number exceeds 2000:
- Thousands digit =0: not a 4-digit number at all.
- Thousands digit =1: the number lies in 1000–1999, which is below 2000.
- Thousands digit ∈{2,3,4,5}: the number is at least 2000. (The exact value 2000 would need three 0s — impossible with distinct digits — so every such number is strictly greater than 2000.)
So the thousands digit has 4 choices.
After fixing the thousands digit, 5 digits remain unused. We fill the remaining 3 positions (hundreds, tens, units) with 3 of those 5 digits, where order matters:
5P3=5×4×3=60.
4-digit count =4×60=240.
Step 3 — 5-digit numbers.
Any 5-digit number is at least 10000>2000, so the only constraint is that the leading digit is not 0.
- Leading digit: {1,2,3,4,5} → 5 choices.
- Remaining 4 positions filled from the 5 unused digits: 5P4=5×4×3×2=120.
5-digit count =5×120=600.
Step 4 — 6-digit numbers.
Any 6-digit number also exceeds 2000. The leading digit cannot be 0.
- Leading digit: {1,2,3,4,5} → 5 choices.
- Remaining 5 positions use all 5 remaining digits: 5P5=5!=120.
6-digit count =5×120=600.
Step 5 — Add the three cases.
| Length | Leading-digit choices | Arrangements of remaining positions | Count |
|---|
| 4-digit (>2000) | 4 — {2,3,4,5} | 5P3=60 | 240 |
| 5-digit | 5 — {1,2,3,4,5} | 5P4=120 | 600 |
| 6-digit | 5 — {1,2,3,4,5} | 5P5=120 | 600 |
| Total | | | 1440 |
240+600+600=1440.
💡 Teacher tip: The key habit here is to split by number-length first, then within each length handle the leading digit separately (it can't be 0), and finally permute the remaining positions. The ">2000" condition only affects the 4-digit case — it simply narrows the leading digit from {1,2,3,4,5} to {2,3,4,5}.
Answer: 1440
Alternative approach (complementary counting for the 4-digit case).
Instead of directly counting 4-digit numbers >2000, count all valid 4-digit numbers and subtract those ≤2000.
- All 4-digit numbers (no repetition): leading digit ∈{1,2,3,4,5} (5 choices), remaining 3 positions 5P3=60 → 5×60=300.
- 4-digit numbers ≤2000: the leading digit must be 1 (the only way to stay below 2000), remaining 3 positions 5P3=60 → 1×60=60.
- 4-digit numbers >2000: 300−60=240.
This matches our direct count. The 5-digit and 6-digit cases remain 600 each, giving the same total of 1440. The direct method is slightly faster here, but complementary counting is a reliable cross-check.
💡 Why the 5-digit and 6-digit counts coincide: 5P4=1!5!=120 and 5P5=0!5!=120 are equal. Removing one position from a full permutation of 5 items doesn't change the count — the "freedom" simply shifts from the arrangement into the choice of leading digit.