Limit of Series: $\frac{1}{n}$

  • Context: Undergrad 
  • Thread starter Thread starter Vitor Pimenta
  • Start date Start date
  • Tags Tags
    Limit Series
Click For Summary
SUMMARY

The limit of the series defined by the expression $\frac{1 + \frac{1}{2} + \frac{1}{3} + ... + \frac{1}{n}}{n}$ converges to 0 as n approaches infinity. This conclusion is supported by applying Cesàro's theorem, which states that if a sequence $\{a_n\}$ converges to L, then the average of the first n terms also converges to L. The proof involves demonstrating that the terms of the sequence diminish in influence as n increases, ultimately leading to the limit being established as 0.

PREREQUISITES
  • Understanding of limits in calculus
  • Familiarity with sequences and series
  • Knowledge of Cesàro's theorem
  • Basic integration techniques
NEXT STEPS
  • Study the proof of Cesàro's theorem in detail
  • Explore the concept of convergence in sequences and series
  • Learn about different methods of evaluating limits
  • Investigate applications of integration in series convergence
USEFUL FOR

Mathematicians, students studying calculus, educators teaching limits and series, and anyone interested in advanced mathematical proofs and convergence concepts.

Vitor Pimenta
Messages
10
Reaction score
1
What should be the limit of the following series (if any ...)

\frac{{1 + \frac{1}{2} + \frac{1}{3} + ... + \frac{1}{n}}}{n}
 
Physics news on Phys.org
Technically, this is not a series but a sequence.

That aside, one way to get the answer is to use, for ##k\geq 2, \frac{1}{k}=\int_{k-1}^k\frac{dx}{k}\leq \int_{k-1}^k \frac{dx}{x} ## .
 
I have just found here that, given a sequence {\left\{ {{a_n}} \right\}_{n = 1}}^\infty, \mathop {\lim }\limits_{n \to \infty } {a_n} = L \Rightarrow \mathop {\lim }\limits_{n \to \infty } \left( {\frac{{{a_1} + {a_2} + {a_3} + ... + {a_n}}}{n}} \right) = L

Instant answer ¬¬'
 
Ah yes, even simpler you're right : )
 
Vitor Pimenta said:
I have just found here that, given a sequence {\left\{ {{a_n}} \right\}_{n = 1}}^\infty, \mathop {\lim }\limits_{n \to \infty } {a_n} = L \Rightarrow \mathop {\lim }\limits_{n \to \infty } \left( {\frac{{{a_1} + {a_2} + {a_3} + ... + {a_n}}}{n}} \right) = L

Instant answer ¬¬'

I don't see how that follows actually. Use that for every ##\epsilon > 0##, there is an ##N## such that ##|a_n-L| < \epsilon##. Then for all ##n## larger than ##N##,
##|\frac{a_1 + ... + a_n}{n} - L| = |\frac{a_1 + ... + a_N}{n} + \frac{(a_{N+1}-L) + ...+ (a_n-L)}{n}| \leq |\frac{a_1 + ... + a_N}{n}| + |\frac{(a_{N+1}-L)}{n}| + ...+ |\frac{(a_n-L)}{n}| < |\frac{a_1 + ... + a_N}{n}| + \frac{\epsilon}{n} + ... + \frac{\epsilon}{n} = |\frac{a_1 + ... + a_N}{n}| + \epsilon.##

As ##n \to \infty##, the expression ##|\frac{a_1 + ... + a_N}{n}|## will converge to 0. In particular, there is some N' such that for all n larger than N', we have ## |\frac{a_1 + ... + a_N}{n}| < \epsilon##. Thus we find that choosing N' large enough (bigger than N), we will have for any chosen ##\epsilon > 0## and for all n larger than N', that ##|\frac{a_1 + ... + a_n}{n} - L| < 2\epsilon## proving that ## \lim_{n \to \infty} |\frac{a_1 + ... + a_n}{n} - L| = 0##.

Note: edited
 
Last edited:
I know this, it's called Cesaro's theorem.
For the proof you can write: ## |(\frac{1}{n}\sum_{k=1}^n a_k) - L | \le \frac{1}{n}\sum_{k=1}^N |a_k - L| + \frac{1}{n}\sum_{k=N+1}^n |a_k - L| ##

The first term tends to 0 as n tends to infinity.
The second term is bounded by ##\frac{n-N}{n} \varepsilon ## for N big enough
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 6 ·
Replies
6
Views
4K
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K