While going through some exercises in my analysis textbook, I came up with an equation which looks like an identity. I strongly believe that this is the case, but I couldn't prove this.
$$\sum_{0\leq k\leq n}(-1)^k\frac{p}{k+p}\binom{n}{k} = \binom{n+p}{p}^{-1}$$
Can someone provide a proof of this identity? Also, it would help a lot if you could explain the general strategy of proving such identities, if there is one, for me. Thank you.
The general strategy is to introduce a variable $x$ and then to deal with some polynomials and/or other power series, of which your expression is a value at $x=1$.
In you case it goes along these lines: $$\sum_{0\leq k\leq n}(-1)^k\frac{p}{k+p}\binom{n}{k}=F(1),\text{ where} \\ F(x)=\sum_{0\leq k\leq n}(-1)^kx^{k+p}\frac{p}{k+p}\binom{n}{k}$$
The power was chosen out of the blue, so that the function would simplify a little when we take a derivative. $$F'(x)=p\cdot\sum_{0\leq k\leq n}(-1)^kx^{k+p-1}\binom{n}{k}=p\cdot x^{p-1}\sum_{0\leq k\leq n}(-x)^k\binom{n}{k}=p\,x^{p-1}(1-x)^n$$
Together with the obvious $F(0)=0$ and the knowledge of beta function, this gives us the way to reconstruct the desired $F(1)$: $$F(1)=\int\limits_0^1F'(x)dx=p\int\limits_0^1x^{p-1}(1-x)^ndx=p\cdot B(p,n+1)=\\ =p\cdot{(p-1)!\;n!\over(n+p)!}={p!\;n!\over(n+p)!}=\binom{n+p}{p}^{-1}$$