I have a solution.
I think it is what the other answerer was trying to explain. (Although I am not sure)
\(\binom{n + 2}{3} = (1)(n) + (2)(n - 1) + (3)(n - 2) + \dots + (k)(n - k + 1) + \dots + (n)(1)\)
Method 1:
The number of subsets of 3 elements from the set of n+2 elements is given by \(\binom{n+2}{3}\)
Method 2:
Let us have 2 sets, A(n elements) and B(2 elements)
How many ways are there to choose 3 elements if two MUST come from set B answer: n
Now take one of the elements from A and put it in set B so A(n-1 elements) and B(3 elements)
How many ways are there to choose 3 elements if two MUST come from set B but one of the 2 must be the new one answer: (n-1) 2 = 2(n-1)
Now take one of the elements from A and put it in set B so A(n-2 elements) and B(4 elements)
How many ways are there to choose 3 elements if two MUST come from set B but one of the 2 must be the new one answer: (n-2) 3 = 3(n-2)
....
and so on until all but one of the elements are in set B n(n-(n-1) = n(1)
So The number of subsets of 3 elements from the set of n+2 elements is also given by
\( (1)(n) + (2)(n - 1) + (3)(n - 2) + \dots + (k)(n - k + 1) + \dots + (n)(1)\)
HENCE
\(\binom{n + 2}{3} = (1)(n) + (2)(n - 1) + (3)(n - 2) + \dots + (k)(n - k + 1) + \dots + (n)(1),\)
I have shown that they are equal by counting in 2 different ways