I have tested some trivial samples when $j = 1,2,3$. But I can't prove if it is true or false generally. Any help would be great, thanks!
Asked
Active
Viewed 38 times
1 Answers
0
Use the fact that $${i\choose k}={i-1\choose k}+{i-1\choose k-1}$$ , which can be proved by expanding the terms.
Emre
- 3,962
-
1Or combinatorially: all groups of $k$ from $i$ either contain the max of the set (last term) or not (first term). – Henno Brandsma May 21 '16 at 14:02