[itex]\lim_{n \to \infty} \sum_{1}^{n} 1/(n+i)=log(2)[/itex]

[Onezimo Cardoso]

Homework Statement

Prove that \lim_{n \to \infty} \displaystyle \sum_{i=1}^{n} \frac{1}{n+i} = log(2).

Homework Equations

[/B]
The Digamma Function \Psi(x) can be written as:

\Psi (x) = \frac{d}{dx} \log(\Gamma(x))

Or, equivalently, as

\Psi(x)=\displaystyle \sum_{l=1}^{k} \frac{1}{x-l}+\Psi(x-k)

The Attempt at a Solution

I tried to put in Wolfram in order to get some hint about this problem and it showed that:

\displaystyle \sum_{i=1}^{n} \frac{1}{n+i} = \Psi(n+(i+1))-\Psi(1+i)

Where \Psi (x) = \frac{d}{dx} \log(\Gamma(x)) is the digamma function as described in Relevant equations.

 

[pasmith]

Homework Statement

Prove that \lim_{n \to \infty} \displaystyle \sum_{i=1}^{n} \frac{1}{n+i} = log(2).

Homework Equations

[/B]
The Digamma Function \Psi(x) can be written as:

\Psi (x) = \frac{d}{dx} \log(\Gamma(x))

Or, equivalently, as

\Psi(x)=\displaystyle \sum_{l=1}^{k} \frac{1}{x-l}+\Psi(x-k)

The Attempt at a Solution

I tried to put in Wolfram in order to get some hint about this problem and it showed that:

\displaystyle \sum_{i=1}^{n} \frac{1}{n+i} = \Psi(n+(i+1))-\Psi(1+i)

i occurs as a summation index on the left. It therefore cannot appear as part of the result of doing the sum. So something is not correct here.

Where \Psi (x) = \frac{d}{dx} \log(\Gamma(x)) is the digamma function as described in Relevant equations.

The digamma function is defined in terms of the gamma function, which is the function which satisfies the recurrence relation <br /> \Gamma(z + 1) = z \Gamma (z) subject to \Gamma (1) = 1.

 

[Ray Vickson]

Homework Statement

Prove that \lim_{n \to \infty} \displaystyle \sum_{i=1}^{n} \frac{1}{n+i} = log(2).

Homework Equations

[/B]
The Digamma Function \Psi(x) can be written as:

\Psi (x) = \frac{d}{dx} \log(\Gamma(x))

Or, equivalently, as

\Psi(x)=\displaystyle \sum_{l=1}^{k} \frac{1}{x-l}+\Psi(x-k)

The Attempt at a Solution

I tried to put in Wolfram in order to get some hint about this problem and it showed that:

\displaystyle \sum_{i=1}^{n} \frac{1}{n+i} = \Psi(n+(i+1))-\Psi(1+i)

Where \Psi (x) = \frac{d}{dx} \log(\Gamma(x)) is the digamma function as described in Relevant equations.

No: Wolfram Alpha did not show $\sum_{i=1}^n 1/(n+i) = \Psi (n+i-1) - \Psi (i+1)$. WA is smart enough to know that a summation over all $i$ from 1 to $n$ cannot contain $i$ in its answer!

Anyway, getting the exact answer like that is not very useful. Another, much, much simpler method gets to the answer quickly and easily; unfortunately, the merest hint of how it works will immediately give away the whole answer.

 

[stevendaryl]

Homework Statement

Prove that \lim_{n \to \infty} \displaystyle \sum_{i=1}^{n} \frac{1}{n+i} = log(2).

Homework Equations

[/B]
The Digamma Function \Psi(x) can be written as:

\Psi (x) = \frac{d}{dx} \log(\Gamma(x))

Or, equivalently, as

\Psi(x)=\displaystyle \sum_{l=1}^{k} \frac{1}{x-l}+\Psi(x-k)

The Attempt at a Solution

I tried to put in Wolfram in order to get some hint about this problem and it showed that:

\displaystyle \sum_{i=1}^{n} \frac{1}{n+i} = \Psi(n+(i+1))-\Psi(1+i)

Where \Psi (x) = \frac{d}{dx} \log(\Gamma(x)) is the digamma function as described in Relevant equations.

That Wolfram result doesn't actually make sense, because there shouldn't be any i in the result: i is a dummy variable.

Just playing around, we can write the original series in this way:

\displaystyle \sum_{i=1}^n \frac{1}{n+i} = \displaystyle \sum_{i=n+1}^{2n} \frac{1}{i} = \displaystyle \sum_{i=1}^{2n} \frac{1}{i} - \displaystyle \sum_{i=1}^{n} \frac{1}{i}

The harmonic series is defined by: H_n = \displaystyle \sum_{i=1}^n \frac{1}{i}, so we can write the sum as:

\displaystyle \sum_{i=1}^n \frac{1}{n+i} = H_{2n} - H_{n}At this point, it seems that you could just use the asymptotic form of H_n for large n.

 

[Onezimo Cardoso]

That Wolfram result doesn't actually make sense, because there shouldn't be any i in the result: i is a dummy variable.

Just playing around, we can write the original series in this way:

\displaystyle \sum_{i=1}^n \frac{1}{n+i} = \displaystyle \sum_{i=n+1}^{2n} \frac{1}{i} = \displaystyle \sum_{i=1}^{2n} \frac{1}{i} - \displaystyle \sum_{i=1}^{n} \frac{1}{i}

The harmonic series is defined by: H_n = \displaystyle \sum_{i=1}^n \frac{1}{i}, so we can write the sum as:

\displaystyle \sum_{i=1}^n \frac{1}{n+i} = H_{2n} - H_{n}At this point, it seems that you could just use the asymptotic form of H_n for large n.

Very impressive view stevendaryl!

I’m trying to use different approaches to see this tricky result. By what you see I could, at least, make an algorithm in C language to check if it really converges to log(2) = 0.69314718 :

 

[Ray Vickson]

Very impressive view stevendaryl!

I’m trying to use different approaches to see this tricky result. By what you see I could, at least, make an algorithm in C language to check if it really converges to log(2) = 0.69314718 :

View attachment 208443

Very impressive view stevendaryl!

I’m trying to use different approaches to see this tricky result. By what you see I could, at least, make an algorithm in C language to check if it really converges to log(2) = 0.69314718 :

View attachment 208443

If you look at it the right way it is not tricky at all, and can be done without any use of a computer, or calculator, or anything.

Once you have assured me that you have turned in the work for marking, I will be happy to post the method. You will kick yourself once you see it!

 

[Onezimo Cardoso]

If you look at it the right way it is not tricky at all, and can be done without any use of a computer, or calculator, or anything.

Once you have assured me that you have turned in the work for marking, I will be happy to post the method. You will kick yourself once you see it!

Actually I’m still trying to see a way to find out this result and I’m doing my best to research in different sources. But you can feel free to send the method as well as the Liu Kang to kick myself =)

 

[Ray Vickson]

Actually I’m still trying to see a way to find out this result and I’m doing my best to research in different sources. But you can feel free to send the method as well as the Liu Kang to kick myself =)

I cannot send the method as long as the work has not yet been turned for marking. That would be against the PF rules.

 

[LCKurtz]

@Ray Vickson: I don't think giving the hint of thinking about an approximating sum to an integral is too much of a hint.