The number of triplets , where are distinct non-negative integers satisfying , is:
- A
- B
- C
- D
The number of triplets , where are distinct non-negative integers satisfying , is:
Correct answer:B
Standard Method
Given: , where are distinct non-negative integers.
Find: The number of triplets satisfying the condition.
First count all non-negative integer solutions:
This counts all solutions, including cases where some variables are equal.
Now consider the case :
So there is exactly such solution.
Next consider the cases where two variables are equal. Suppose . Then
so
The distinct solutions occur when takes values from to . Hence there are such solutions.
Therefore, the required number of distinct solutions is
Therefore, the number of distinct non-negative integer triplets is . The correct option is B.
Using total solutions minus equal-value cases
Given: with distinct non-negative integers.
Find: The number of valid ordered triplets.
The solution uses stars and bars to count all non-negative integer solutions first:
Then subtract solutions that are not distinct.
So one invalid triplet occurs.
Then
From the extracted solution, can take values from to , giving such cases.
Subtracting these from the total:
Hence the required number of triplets is .
Counting all non-negative integer solutions and stopping at is incorrect because that includes cases where two or three variables are equal. You must remove non-distinct cases.
Ignoring the case is wrong because satisfies but does not satisfy distinctness. Subtract this case separately.
Treating 'distinct triplets' as unordered selections is incorrect here. The solution counts ordered triplets satisfying the equation, so use the equation-solution counting approach rather than combination selection.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.