How Do You Calculate an Infinite Sum of Fractions Involving Limits?

Click For Summary

Discussion Overview

The discussion centers on calculating an infinite sum of fractions that involves limits, specifically the limit of a sum where the summands include a limit-dependent expression. The context includes theoretical exploration related to channel capacity in communication schemes.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • The initial post presents a limit of a sum and suggests that it converges to a value related to channel capacity, seeking methods to compute this limit.
  • One participant questions the convergence of the sum, suggesting it resembles a harmonic series, which is known to diverge.
  • Another participant provides bounds for the summands, indicating that the limit cannot diverge to infinity, and suggests that approximation methods may be more practical than exact computation.
  • A mathematical transformation is proposed that rewrites the limit as an integral, potentially simplifying the evaluation of the sum.
  • There is a repeated concern about the convergence of the sum, with references to the properties of harmonic series and their differences.

Areas of Agreement / Disagreement

Participants express differing views on the convergence of the sum, with some asserting it diverges while others suggest it does not. The discussion remains unresolved regarding the convergence and the best method for evaluating the limit.

Contextual Notes

Participants note the dependence on the behavior of the summands and the potential for approximation methods, but do not reach a consensus on the convergence or the exact evaluation of the limit.

miggimig
Messages
3
Reaction score
0
Hi,

actually, I need to calculate an infinite sum of fractions. The problem is that the Limit of the sum is part of the summands. The formula looks like this:

\lim_{n \to \infty} \sum_{i=1}^{n} \frac{1}{n(1 + \lambda + \sigma^2)-i(1+\lambda)},

where 'itex]\sigma[/itex] and \lambda are constants. Numerically, this infinite sum converges to a value that can be interpreted as a first order approximation of a channel capacity for some communication scheme.

My idea to determine this limit is to calculate the finite sum of n terms first. Since, in this case, n is constant, the sum can be written as:

\sum_{i=1}^{n}{\frac{1}{a-ib}}, where a > n b

When it would be possible to find a conversion of this sum, I thought it might also be possible to determine the limit for n to \infty.

If anyone has ideas how to solve the problem, I would be grateful for comments and feedback.

Thanks a lot,

Michael
 
Physics news on Phys.org
Are you sure the sum converges? Off hand it looks like (term by term) it converges to a harmonc series, which diverges.
 
The largest summand is 1 / ( n(1+\lambda + \sigma^2) - (1 + \lambda)) and the smallest summand is 1 / (n \sigma^2), so the limit (or limit points, if it doesn't converge) must be between 1 / \sigma^2 and 1 / (1 + \lambda + \sigma^2), so the limit can't diverge to \infty.

For the opening poster -- it is probably much easier to approximate rather than compute exactly. Since the series does resemble the harmonic series, it might be useful to use a well-known approximation (or one of your basic approximation methods if you don't recall it)...
 
\lim_{n \to \infty} \sum_{i=1}^{n} \frac{1}{n(1 + \lambda + \sigma^2)-i(1+\lambda)}\\<br /> =\lim_{n \to \infty} \dfrac{1}{n}\sum_{i=1}^{n} \frac{1}{(1 + \lambda + \sigma^2)-\frac{i}{n}(1+\lambda)}\\<br /> =\int_{0}^{1}\frac{dx}{(1 + \lambda + \sigma^2)-x(1+\lambda)}<br />
 
mathman said:
Are you sure the sum converges? Off hand it looks like (term by term) it converges to a harmonc series, which diverges.

The above sum is similar to a difference of harmonic series. Something like
H_{2n} - H_{n}=\sum_{k=1}^{n} \frac{1}{n+k}
which converges to \ln 2.
 
Thank you all very much! You helped me a lot!
 

Similar threads

  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K