MHB Finite Binomial Sum: Proving 1 + 1/2 + 1/3 + ... + 1/n

DreamWeaver
Messages
297
Reaction score
0
Show that

$$\sum_{j=1}^{j=n}\binom{n}{j} \frac{(-1)^{j+1}}{j} = 1 +\frac{1}{2} +\frac{1}{3} + \cdots +\frac{1}{n}$$
 
Mathematics news on Phys.org
A small hint
- is missing :o
 
lfdahl said:
A small hint
- is missing :o

Really sorry, Ifdahl!
Keep thinking I'll have time, and then I'm unexpectedly busy... Bad mammal! :o:o:o

Sorry...
 
Nice question. I think I know how to approach it. I'll write the solution later.
 
$$\sum_{j=0}^n {n \choose j}(-x)^j=(1-x)^n
$$

$$\sum_{j=1}^n {n \choose j}(-1)^{j}x^{j-1}=\frac{(1-x)^n-1}{x}
=-\sum^n_{j=1}(1-x)^{j-1}$$

$$\int^1_0\sum_{j=1}^n {n \choose j}(-1)^{j}x^{j-1}dx=-\sum^n_{j=1}\int^1_0(1-x)^{j-1}dx=-\sum^n_{j=1}\frac{1}{j}$$
$$\sum_{j=1}^n {n \choose j}\frac{(-1)^{j+1}}{j}=H_n$$
 
Last edited:
DreamWeaver said:
Show that

$$\sum_{j=1}^{j=n}\binom{n}{j} \frac{(-1)^{j+1}}{j} = 1 +\frac{1}{2} +\frac{1}{3} + \cdots +\frac{1}{n}---(1)$$
to prove (1)we can also use the method of induction
it is easy to show that (1) is true when n=1,2,3--
suppose (1) is true as n=m ,now we need to prove :
$$\sum_{j=1}^{j=m+1}\binom{m+1}{j} \frac{(-1)^{j+1}}{j} = 1 +\frac{1}{2} +\frac{1}{3} + \cdots +\frac{1}{m+1}---(2)$$
the proof of (2):
we use the formula :

$$\binom{m+1}{j} =\binom{m}{j}+\binom{m}{m+1-j} $$

and the rest is not hard (many terms can be canceled)
now it is too late , I am going to sleep ,hope someone can finish it
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Back
Top