I've already proved this statement algrebraically. I'm asked to prove it with combinatorics.
So far I came up with,
LHS= # ways to choose m apples from a total of m,m+1,...,n
RHS= # ways to choose m+1 apples from a total of n+1
I've just started combinatorics so I'm not really familiar with what a combinatorics proof looks like. I don't manage to link these two ways of counting without refering to my algebraic proof. A little help would be very appreciated.
Thanks in advance.