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

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
 
Mathematics 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!
 
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...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top