Solving the Summation Cases Let $n$ be a positive integer. Prove that
$\displaystyle \sum_{k=1}^{n} \dfrac{(-1)^{k-1}} {k} \binom{n} {k} = 1 +\dfrac{1}{2} + \dfrac{1}{3} + \cdots + \dfrac{1}{n}$
I and my friend discussed this two days ago. In this case, we prove that
it goes to $\displaystyle \sum_{k=1}^{n} \dfrac{1}{k}$ (right-hand side expression in summation form), but unfortunately we went nothing. One thing that really evaporates the difficulty is when you need to apply the binomial expressions, related to summation lower bound and upper bound, to prove it, however I suspect that we may lack of knowledge knowing the identity/theorem which maybe useful to approach this problem. So, do you have any idea for this one?  

The following variation is Example 3 in section 1.2  of John Riordan's classic Combinatorial Identities.

Consider for $n=1,2,\ldots$
  \begin{align*}
f_n&=\sum_{k=1}^n(-1)^{k+1}\binom{n}{k}\frac{1}{k}\\
&=\sum_{k=1}^n(-1)^{k+1}\left[\binom{n-1}{k}+\binom{n-1}{k-1}\right]\frac{1}{k}\\
&=f_{n-1}-\frac{1}{n}\sum_{k=1}^n(-1)^k\binom{n}{k}\\
&=f_{n-1}-\frac{1}{n}\left[(1-1)^n-1\right]\\
&=f_{n-1}+\frac{1}{n}\\
&=H_n
\end{align*}
  since $f_1=1$.

