What is the Inverse Series Method for Calculating Output Fractions?

Click For Summary
The discussion centers on the Inverse Series Method for calculating output fractions of the Harmonic series, which diverges but can be approximated. The asymptotic approximation for the Harmonic series is given by the formula involving the Euler-Mascheroni constant, allowing for estimates of the number of terms needed to reach specific outputs. For example, to achieve an output of 10, approximately 12,370 terms are needed. The conversation also explores the relationship between the series and integrals, highlighting how the area under the curve approximates the series' sum. Ultimately, the thread emphasizes the complexity of finding exact outputs due to the series' divergence.
shintashi
Messages
117
Reaction score
1
hi,

im trying to find out how to get the inverse of the series 1/1+1/2+1/3+1/4...
i know the output of 30 is approximately 3.99 and 450 is around 6.6, but I'd like to be able to find the fraction range for outputs of numbers such as 10, 20, and 72. The online series calculators tend to die around output 14. My knowledge of integrals and series is weak at best.
 
Physics news on Phys.org
Well the series you stated is known as the Harmonic series, and is famously known to diverge because if it did not, it would imply the number of elements in the set of the Prime numbers is finite.

It seems like even though it diverges, you want to approximate its values for a certain amount of terms, and I can help you there. There is a well known asymptotic approximation for the Harmonic series, which diverges as well, but even though it does, its a good approximation because it diverges at a similar rate.

Basically \lim_{n\to\infty} \frac{ \sum_{k=1}^{n} (1/k) }{\log_e (n) +\gamma} = 1 where lower case gamma denotes the Euler-Mascheroni constant, which from memory is about 0.577 though there are better numerical approximations.

What that means is that as n becomes larger, \log_e n + \gamma will approximate the n-th partial sum of the harmonic series will less and less error. So say I wanted to know how many terms I would need for an output of 10, an approximate solution can be obtained by setting \log_e n + \gamma = 10, so n is approximately 12,370.

As a side note, we can see why the asymptotic expression for the harmonic series is a very plausible thing if we plot y=1/x on the Cartesian plane. Looking at the region for values of x onwards, we know the area bounded by x=1, x=k, y=1/x and y=0 (the area under the curve between x=1 and k) is given by \log_e k. Now draw rectangles, first one between x=1 and 2, with height of 1, then between x=2 and 3, height of 1/2, and general term; rectangle between x=a and a+1, height of 1/a.

We can see that the difference in the area of the rectangles and the area under the curve is only a finite amount, the rectangles approximate the curve better and better. Now it is merely a numerical computation to evaluate the finite amount of difference.
 
My interpretation of "inverse" was the other way around: For what n is the series equal to (or larger than) M? That problem only makes sense because the series diverges and so is, for some n, larger than or equal to any M. Unforunately, I also do not see any reasonable way of finding that.
 
HallsofIvy said:
My interpretation of "inverse" was the other way around: For what n is the series equal to (or larger than) M? That problem only makes sense because the series diverges and so is, for some n, larger than or equal to any M. Unforunately, I also do not see any reasonable way of finding that.

I believe I did answer that =] In fact I evaluated an example, M=10, then n= 12, 370.
 
Here is a simple approximation.

Consider f(x) = \frac{1}{x} on [1,\infty) this is a decreasing,continous,positive function. So that means, \sum_{k=1}^{n-1}\frac{1}{k} \geq \int_1^n \frac{dx}{x} \implies \sum_{k=1}^n \frac{1}{k} \geq \log n + \frac{1}{n} and \sum_{k=2}^n \frac{1}{k} \leq \int_1^n \frac{dx}{x} \implies \sum_{k=1}^n \frac{1}{k} \leq \log n + 1. Together these inequalities say \log n + \frac{1}{n} \leq \sum_{k=1}^n \frac{1}{k} \leq \log n + 1
 
Update: I fiddled with the series for a while and discovered (probably to no one's surprise) that the difference between the sum of any two integers such as ~11 and ~12, or between ~15 and ~16 is a ratio of total fractions approaching e (2.7182818...)

Here's a small list of the final "k"
(sigma[a,b,1/k] a = first number, b = last number, equation sums all ranges a to b, thus +1/1, +1/2, +1/3… etc. Example: sigma[1,11,1/k] = 3.0198… Rounds down to 3.)

note: I am using ~ for "approximately equals)

1=1
2~4
3~11
4~31
5~83
.
.
.
227
616
1,674
4,550
12,367
33,617
91,380
248,397
675,215
1, 835,426
4,989,205
13,562,065
36,865,516
100,210,865
272,401,372
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 7 ·
Replies
7
Views
8K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
2
Views
585
Replies
3
Views
1K