Divisibility of Numerator of Sum of Sequence of Reciprocals/Lemma

Lemma for Divisibility of Numerator of Sum of Sequence of Reciprocals
Let $n \in \Z_{>0}$ be a (strictly) positive integer.

Then:
 * $\ds \sum_{k \mathop = 1}^n \dfrac {\paren {-1}^{k - 1} } k \dbinom n k = \sum_{k \mathop = 1}^n \dfrac 1 k$

where $\dbinom n k$ denotes a binomial coefficient.

Proof
Expanding the summation:

Let:

Then we have:

The proof proceeds by induction.

For all $n \in \Z_{>0}$, let $\map P n$ be the proposition:
 * $\ds \sum_{k \mathop = 1}^n \dfrac {\paren {-1}^{k - 1} } k \dbinom n k = \sum_{k \mathop = 1}^n \dfrac 1 k$

Basis for the Induction
$\map P 1$ is the case:

Thus $\map P 1$ is seen to hold.

This is the basis for the induction.

Induction Hypothesis
Now it needs to be shown that if $\map P r$ is true, where $r \ge 1$, then it logically follows that $\map P {r + 1}$ is true.

So this is the induction hypothesis:
 * $\ds \sum_{k \mathop = 1}^r \dfrac {\paren {-1}^{k - 1} } k \dbinom r k = \sum_{k \mathop = 1}^r \dfrac 1 k$

from which it is to be shown that:
 * $\ds \sum_{k \mathop = 1}^{r + 1} \dfrac {\paren {-1}^{k - 1} } k \dbinom {r + 1} k = \sum_{k \mathop = 1}^{r + 1} \dfrac 1 k$

Induction Step
This is the induction step:

So $\map P k \implies \map P {k + 1}$ and the result follows by the Principle of Mathematical Induction.

Therefore: