Question 4.8: The series ∑1/n^p converges for all p > 1.

The series \sum{1/n^{p}} converges for all p > 1.

The blue check mark means that this solution has been answered and checked by an expert. This guarantees that the final answer is accurate.
Learn more on how we answer questions.

For any n ∈ \mathbb{N}, let

S_{n} = \sum\limits_{k=1}^{n}\frac{1}{k^{p} },   T_{n} = S_{2^{n}}.

Then

T_{n+1} –  T_{n} = \sum\limits_{k=2^{n}+1}^{2^{n+1}}{\frac{1}{k^{p}}}

 

=\frac{1}{(2^{n}+1)^{p}} + \frac{1}{(2^{n}+2)^{p}} + · · · + \frac{1}{(2^{n+1})^{p}}

 

< \frac{1}{2^{np}} + \frac{1}{2^{np}} + · · · + \frac{1}{2^{np}}

 

=\frac{2^{n}}{2^{np}}

 

= \frac{1}{2^{n(p-1)}}.

Hence

T_{n+1} = \sum\limits_{k=0}^{n}{(T_{k+1} − T_{k})} + T_{0}

 

< \sum\limits_{k=0}^{n}{\frac{1}{2^{k(p−1)}} + T_{0}}

 

< \frac{1}{1 − (1/2)^{p−1}} + T_{0} = K,

where we used the formula derived in Example 4.1 for the sum of the geometric series ∑^{∞}_{k = 0} (1/2^{p−1})^{k}. Thus the positive sequence (T_{n}) is bounded above by the constant K. Since the sequence (2^{m}) is increasing and unbounded, for any n ∈ \mathbb{N} there is an m ∈ \mathbb{N} such that 2^{m} > n; and since (S_{n}) is an increasing sequence, we have

S_{n} ≤ S_{2^{m}} = T_{m} ≤ K,

which implies (S_{n}) is bounded and therefore convergent, by Theorem 3.7.

Related Answered Questions

Question: 4.T.9

Verified Answer:

To prove the first inequality, let L = \lim...
Question: 4.T.3

Verified Answer:

Suppose \sum{|x_{n}|} converges. We...
Question: 4.T.5

Verified Answer:

Let \sum{x_{n}} be absolutely conve...