Consider the partition \lambda=(m,n-m) of n (thus 2m \ge n.)


The number of Young
tableaux of shape \lambda is given by
f_{(m,n-m)} = \binom nm - \binom{n}{m+1}


a) Prove this using the hook-length formula.


b) Prove this using induction on n

Please, help!