The number of triplets where are distinct non negative integers satisfying , is
We need to find the number of triplets of distinct non-negative integers satisfying .
Total solutions without distinctness constraint.
The number of non-negative integer solutions of is:
Subtract solutions where at least two variables are equal.
Let A = {x = y}, B = {y = z}, C = {x = z}.
: If , then , so ranges from 0 to 7. That gives 8 solutions. Similarly .
: If , then , so . That gives 1 solution. Similarly for all pairwise intersections and the triple intersection: .
By inclusion-exclusion:
Distinct solutions.
The number of triplets is 114.
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.