Let be a real-valued sequence such that for all , for some , and converges to a finite value. Which of the following is the STRONGEST true statement that can be made about ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If a n does not converge to 0 , then there is some ϵ > 0 and some subsequence a n k of a n such that a n k ≥ ϵ for all n k . Then n = 1 ∑ ∞ a n ≥ k = 1 ∑ ∞ a n k ≥ k = 1 ∑ ∞ ϵ = ϵ k = 1 ∑ ∞ 1 = ∞ .