Prove the convergence/divergence of a given series

  • Thread starter Thread starter mahler1
  • Start date Start date
  • Tags Tags
    Series
Click For Summary

Homework Help Overview

The discussion revolves around proving the convergence or divergence of a series defined by the general term \( a_n = \frac{1}{n^p \log(n)^q} \) for \( n \geq 2 \). Participants explore conditions under which the series converges or diverges based on the values of \( p \) and \( q \).

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss using the integral test for certain cases and the Cauchy condensation test for others. There are inquiries about the implications of convergence for related series and the validity of applying comparison tests.

Discussion Status

Some participants have provided guidance on using the comparison test and integral test, while others are still exploring how to handle specific cases, particularly when \( q > 0 \) and \( p < 1 \). There is an ongoing examination of the conditions for convergence and divergence without reaching a consensus.

Contextual Notes

Participants are navigating the complexities of convergence criteria and the relationships between different series, with some uncertainty about the application of certain tests and the implications of their findings.

mahler1
Messages
217
Reaction score
0
Homework Statement .

Show that the series with general term ##a_n=\dfrac{1}{n^plog(n)^q}, n\geq 2##

converges if: ##q>0## and ##p>1##; ##q>1## and ##p=1##
diverges if: ##q>0## and ##p<1##; ##0<q\leq 1## and ##p=1##

The attempt at a solution.

I could solve the problem for the cases ##q>1## and ##p=1##, and ##0<q\leq 1## and ##p=1##:

For these two cases I can use the integral test where ##f(x)=\dfrac{1}{xlog(x)^q}##.

By making the substitution ##u=log(x)##, I got that ##\int_2^{+\infty} f(x)dx## converges if and only if q>1.

Now, I don't now how to show the convergence and divergence respectively for the other two remaining cases (q>0). I would appreciate any suggestions.
 
Physics news on Phys.org
Do you know the Cauchy condensation test?
 
  • Like
Likes   Reactions: 1 person
micromass said:
Do you know the Cauchy condensation test?

Sure, so now I have to analyze the convergence of the series of term ##b_n=\dfrac{2^n}{(2^n)^plog(2^n)^q}##. So ##\dfrac{2^n}{(2^n)^plog(2^n)^q}=\dfrac{2^{n(1-p)}}{n^qlog(2)^q}=\dfrac{(2^{1-p})^n}{n^qlog(2)^q}##.

I know that the series ##\sum \dfrac{1}{n^q}## converges if ##q>1## and that the geometric series ##\sum (\dfrac{1}{2^{p-1}})^n## converges for ##p-1\geq 1##, which means, for ##p>1##.

Now, I have some doubts on the following: Is it true that if ##\sum a_n## and ##\sum b_n## converge ##\implies## ##\sum a_nb_n## converges? If this is the case, by what I've previously said, the original series would converge for ##p>1## and ##q>1##. For the same reason, if what I've asked is true, then for ##q=1## and ##p>1## the original series converges as well.

I still don't know what to do if ##q>0## and ##p<1##
 
Last edited:
mahler1 said:
Sure, so now I have to analyze the convergence of the series of term ##b_n=\dfrac{2^n}{(2^n)^plog(2^n)^q}##. So ##\dfrac{2^n}{(2^n)^plog(2^n)^q}=\dfrac{2^{n(1-p)}}{n^qlog(2)^q}=\dfrac{(2^{1-p})^n}{n^qlog(2)^q}##.

I know that the series ##\sum \dfrac{1}{n^q}## converges if ##q>1## and that the geometric series ##\sum (\dfrac{1}{2^{p-1}})^n## converges for ##p-1\geq 1##, which means, for ##p>1##.

Now, I have some doubts on the following:


Is it true that if ##\sum a_n## and ##\sum b_n## converge ##\implies## ##\sum a_nb_n## converges?

In this case (series of positive numbers) it is true. But you could just apply the comparison criterion instead of this theorem, which I guess you will need to prove in order to use it (you can prove it by the comparison criterion!)

If this is the case, by what I've previously said, the original series would converge for ##p>1## and ##q>1##.

Try the comparison test.

I still don't know what to do for the cases ##q=1## and ##p>1##

Comparison test will work here too. The idea is that the exponential will always dominate the polynomial factor. So if the exponential goes to ##0##, then it will do so way faster than any polynomial factor, making the series diverge.

##q>0## and ##p<1##

The exponential factor will diverge here and this will again dominate the entire series. So try to show divergence. Think about the limit of the sequence of terms.
 
  • Like
Likes   Reactions: 1 person
micromass said:
In this case (series of positive numbers) it is true. But you could just apply the comparison criterion instead of this theorem, which I guess you will need to prove in order to use it (you can prove it by the comparison criterion!)
Try the comparison test.
Comparison test will work here too. The idea is that the exponential will always dominate the polynomial factor. So if the exponential goes to ##0##, then it will do so way faster than any polynomial factor, making the series diverge.
The exponential factor will diverge here and this will again dominate the entire series. So try to show divergence. Think about the limit of the sequence of terms.
For convergence I could prove with the comparison test, as you've suggested. For q>0 and p<1, I could show divergence by the ratio test, thanks for the help!
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 7 ·
Replies
7
Views
3K