1

Proof

$$ \sum_{k=1}^n (-1)^{k-1} \binom{n}{k} \dfrac{1}{k} = 1 + \dfrac{1}{2} + \dots + \dfrac{1}{n} $$


This might be a silly question asked by someone else but I cannot find it right now.

I tried to verify this formula in Mathematica, and I am sure that this statement is correct.

The first approach I tried is to use generating functions and the binomial theorem, where I got

$$ \dfrac{\partial}{\partial x}(-\sum _{k=1}^n \dfrac{x^k}{k} \binom{n}{k}) = -\sum _{k=1}^n x^{k-1} \binom{n}{k} = \dfrac{1-(x+1)^n}{x} $$

But I am having difficulties integrating the RHS: even Mathematica gives a function that includes "HypergeometricPFQ" which is not elementary.

The second approach I tried is to use induction. But I find it really difficult to use the inductive hypothesis.

Is there a better way to solve this question? Or where can I find any resources?

But

0 Answers0