# Thread:

1. ## [Solved] ....

Claim: The series $\sum_{n=1}^{ \infty} \frac{2}{n^2 + n}$ converges.

By definition:
The series $\sum_{n=1}^{ \infty} \frac{2}{n^2 + n} = \sum_{n=1}^{ \infty} a_n$ converges if and only if for every $\epsilon > 0$, there exists some $N \in \mathbb{N}$ such that for all $n, m$ with $n > m \geq N$, we have $|a_{m+1} + a_{m+2}+ ...+ a_n| < \epsilon$.

(Attempted) proof:
Let $m \in \mathbb{N}$ be arbitrary but fixed, and let $S_m = \sum_{n=1}^{m} \frac{2}{n^2 + n}$. Then the sequence $(S_m)$ is convergent, and it necessarily follows that $(S_m)$ is Cauchy. That is, for all $\epsilon > 0$, there exists some $N \in \mathbb{N}$ such that for all $n, m \geq N$, we have $|S_{n} - S_{m}| < \epsilon$.

But if $n > m \geq N$, we have $|S_n - S_m| = |a_{m+1} + a_{m+2}+ ...+ a_n| < \epsilon$

which shows, directly from the definition, that the series $\sum_{n=1}^{ \infty} \frac{2}{n^2 + n}$ is convergent. $\square$

Is this satisfactory? Or is there a more simplistic approach that I should be taking?

2. 1) Do you have to do this by definition, or have you already seen the comparison test?

2) If you want to do this by definition, then you didn't prove anything. You stated that $\displaystyle S_m = \sum_{n=1}^{m} \frac{2}{n^2 +n}$ is convergent, which means $\displaystyle \lim_{m \to \infty} S_m = \sum_{n=1}^{m} \frac{2}{n^2+n}$ converges, but that is what you have to prove! What you said is "this series converges because it converges" - this is not a proof.

3. Originally Posted by Defunkt
1) Do you have to do this by definition, or have you already seen the comparison test?

2) If you want to do this by definition, then you didn't prove anything. You stated that $\displaystyle S_m = \sum_{n=1}^{m} \frac{2}{n^2 +n}$ is convergent, which means $\displaystyle \lim_{m \to \infty} S_m = \sum_{n=1}^{m} \frac{2}{n^2+n}$ converges, but that is what you have to prove! What you said is "this series converges because it converges" - this is not a proof.
Well, I've stated that $S_m$ is convergent since m is finite and fixed. The rest of the "proof" was intended to show that this extends to the case in which n goes to infinity.

I did try my hand at the comparison test, but wasn't very successful there either. I'll give it another shot and see what I come up with.

4. If m is finite and fixed then $S_m$ is just a number. It does not depend on n.

The easiest way to prove this is by using the comparison test. I assume you have proved that $\displaystyle \sum_{n=1}^{\infty} \frac{1}{n^2}$ converges. Now,

$\frac{2}{n^2+n} \le \frac{2}{n^2} \ \forall n \in \mathbb{N}$

and so

$\displaystyle \sum_{n=1}^{\infty} \frac{2}{n^2 + n}$ converges iff $\displaystyle \sum_{n=1}^{\infty} \frac{1}{n^2}$ converges, since they both have positive terms.

5. Wow. I literally just made the connection with that particular series before coming back to see your post.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 29, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9717325568199158, "perplexity_flag": "head"}