To form distinct 4-digit even numbers using the digits 0, 1, 2, 3, 4, 5 without repetition, we must consider two main restrictions:
1. The number must be even, meaning its unit's digit must be 0, 2, or 4.
2. The thousand's digit (first digit) cannot be 0.
We will use case analysis based on the unit's digit:
**Case 1: The unit's digit is 0.**
Let the 4-digit number be represented by
d1d2d3d4.
* **
d4 (Unit's digit):** Must be 0. There is 1 choice (0).
* **
d1 (Thousand's digit):** Since 0 is already used for
d4, and
d1 cannot be 0, we can choose from the remaining 5 digits {1, 2, 3, 4, 5}. So, there are 5 choices for
d1.
* **
d2 (Hundred's digit):** Two digits have been used (one for
d4, one for
d1). From the remaining 4 digits, there are 4 choices for
d2.
* **
d3 (Ten's digit):** Three digits have been used. From the remaining 3 digits, there are 3 choices for
d3.
Number of ways for Case 1 =
5×4×3×1=60.
**Case 2: The unit's digit is 2 or 4.**
Let's consider these two possibilities together because the restriction on
d1 (not being 0) interacts similarly with both.
* **
d4 (Unit's digit):** Can be 2 or 4. There are 2 choices.
* **
d1 (Thousand's digit):** This is the tricky part. One non-zero digit (2 or 4) has been used for
d4. The remaining digits include 0.
d1 cannot be 0. So, from the initial 6 digits, one non-zero digit is used, and 0 is not allowed for
d1. This leaves
6−2=4 choices for
d1 (e.g., if
d4=2, the choices for
d1 are {1, 3, 4, 5}).
* **
d2 (Hundred's digit):** Two digits have been used (
d4 and
d1). From the remaining 4 digits (which now includes 0), there are 4 choices for
d2.
* **
d3 (Ten's digit):** Three digits have been used. From the remaining 3 digits, there are 3 choices for
d3.
Number of ways for Case 2 = (Choices for
d1)
× (Choices for
d2)
× (Choices for
d3)
× (Choices for
d4)
Number of ways for Case 2 =
4×4×3×2=96.
**Total number of distinct 4-digit even numbers:**
Summing the ways from both cases:
Total = Case 1 + Case 2 =
60+96=156.
Therefore, 156 distinct 4-digit even numbers can be formed.
**Why other options are incorrect:**
* **(A)
120:** This might be obtained by incorrect handling of cases or a calculation error, possibly by treating the leading digit restriction less carefully. For instance, if one assumed 5 choices for the first digit (excluding 0) and then simply chose 3 positions, without proper case analysis for the last digit. Or, it could be
P(5,3)×1=60 for each of the 2,4 options if 0 was not an issue in the
d1 choice or if cases were missed. (
P(5,3)×2=120 if 0 was allowed at start). This isn't how it works with the leading zero and even number constraints combined.
* **(C)
180:** This would be the answer if the leading digit could be 0, but only for numbers ending in 2 or 4. If we incorrectly calculated
P(5,3)×3 (for the 3 even digits 0, 2, 4), treating all positions similarly, without accounting for the leading zero restriction:
5×4×3×3=180. This overlooks the first digit cannot be zero when the last digit is non-zero (2 or 4). Specifically, it would be
5×4×3×1=60 (for 0) and
5×4×3×1=60 (for 2) and
5×4×3×1=60 (for 4), leading to 180, if the leading zero constraint was completely ignored or mishandled.
* **(D)
192:** This value does not correspond to any standard miscalculation for this type of problem and is likely a result of several compounding errors.
The final answer is
156.
**Common Mistakes:**
1. **Forgetting the leading zero restriction:** Many students forget that the first digit of a number cannot be 0, especially when 0 is part of the available digits. This leads to overcounting.
2. **Not using case analysis when restrictions interact:** The 'even number' restriction (last digit) interacts with the 'no leading zero' restriction. If the last digit is 0, the first digit has more options than if the last digit is 2 or 4 (because 0 is no longer available to cause a leading zero issue). Failing to separate these cases leads to incorrect counts.
3. **Incorrectly managing available choices:** After placing digits in restricted positions, students sometimes miscount the remaining available digits for subsequent positions, often forgetting to include 0 when it becomes available for non-leading positions.
4. **Confusing permutations with repetition vs. without repetition:** The problem explicitly states "without repetition", which means choices decrease for each subsequent position. Forgetting this would lead to
nr type calculations.