While I can solve the problems algebraically, I have trouble thinking of these problems in a combinatorial way, like: "Let's say we choose $ k$ people from a group of $n$ such that $r$ people satisfy the conditions..."
How should I approach such problems in that way? I'd appreciate any tips or hints.
Prove that $ \sum_{k=r}^{n} {n \choose k } {k \choose r } 2^k = {n \choose r } 2^r 3^{n-r} $, where $ n \ge r \ge 1 $ are natural numbers.
Describe "combinatoricly" $ \sum_{s=0}^{n} {n \choose s } {s \choose k-s } $ , where $ n, k$ are naturals.
For the first one, suppose there are $n$ players who appear for the team tryouts. You can shortlist $k$ players from these $n$ and then, make a starting lineup consisting of $r$ players. Meanwhile, any no. of players in the shortlist can also be given new equipment. This can be counted in precisely $\sum\limits_{k=r}^n \binom n r \binom k r 2^k$ ways.
Alternatively, to achieve the same effect, you can just choose the $r$ starters from the $n$ players in the tryouts, decide which players in the starting lineup get new equipment, and then, categorise the remaining players into three groups.
$1$. Not on the shortlist,
$2$. On the shortlist not given new equipment,
$3$. On the shortlist given new equipment.
This can be done in $\binom{n}{r}2^r3^{n-r}$ ways.
Therefore, these must be equal.