I am learning about combinatorics and am trying to solve the following problem.
Find the value of
$$\sum_{k=0}^n {n\choose k}(-1)^k\frac{1}{k+1}$$
for several values of n. What do you think is the value in general? Prove it.
I have carried out some calculations for various values of n and I think that the solution in terms of $n$ is
$$\sum_{k=0}^n {n\choose k}(-1)^k\frac{1}{k+1}=\frac{1}{n+1}.$$
I also think that induction is not a very helpful way to prove this.
I would appreciate any hints (no complete solutions, please!).