Does Σ 1/(n(log(n))^p) Converge for p>1?

  • Context: Graduate 
  • Thread starter Thread starter hivesaeed4
  • Start date Start date
  • Tags Tags
    Convergence
Click For Summary
SUMMARY

The series Σ 1/(n(log(n))^p) converges for p > 1, as established through two methods: the integral test and Cauchy's condensation test. The integral test evaluates the improper integral ∫_2^∞ (1/x(log(x))^p) dx, yielding a finite result for p > 1. Cauchy's condensation test demonstrates that the series can be transformed into a converging series of the form Σ 1/k^p, confirming convergence for p > 1.

PREREQUISITES
  • Understanding of convergence tests in calculus
  • Familiarity with improper integrals
  • Knowledge of logarithmic functions and their properties
  • Basic principles of series and sequences
NEXT STEPS
  • Study the Integral Test for convergence in more detail
  • Explore Cauchy's Condensation Test and its applications
  • Learn about the properties of logarithmic functions in series
  • Investigate other convergence tests such as the Ratio Test and Root Test
USEFUL FOR

Mathematicians, calculus students, and anyone interested in series convergence, particularly those studying advanced calculus or real analysis.

hivesaeed4
Messages
217
Reaction score
0
Has anybody got any idea as to how to prove that Ʃ 1/(n(log(n))^p) converges? (where p>1)
 
Physics news on Phys.org
0 < log(n) < n for n>3
 
hivesaeed4 said:
Has anybody got any idea as to how to prove that Ʃ 1/(n(log(n))^p) converges? (where p>1)


First way, the integral test: \int_2^\inf \frac{1}{x\log^px} dx=\frac{\log^{1-p}(x)}{1-p}|_2^\inf \rightarrow \frac{log^{1-p}(2)}{p-1} .

Second way, Cauchy's Condensation test: taking n=2^k , the series's general term is \frac{1}{2^kk^p\log^p(2)} , so multiplying this by 2^k we get \frac{1}{k^p\log^p(2)} , which is a multiple of the series of \frac{1}{k^p} , which we know converges for p&gt;1 .

DonAntonio
 
DonAntonio said:
First way, the integral test: \int_2^\inf \frac{1}{x\log^px} dx=\frac{\log^{1-p}(x)}{1-p}|_2^\inf \rightarrow \frac{log^{1-p}(2)}{p-1} .

Second way, Cauchy's Condensation test: taking n=2^k , the series's general term is \frac{1}{2^kk^p\log^p(2)} , so multiplying this by 2^k we get \frac{1}{k^p\log^p(2)} , which is a multiple of the series of \frac{1}{k^p} , which we know converges for p&gt;1 .

DonAntonio

Thing is I've got to prove determine it's convergence from 1 to infinity.
 
Just to clarify, the previous message was supposed to be:
Thing is I've got to determine it's convergence from 1 to infinity.
 
If the sum starts at 1, you have a problem because log(1)=0
 
The sum from 1 to any fixed number will always converge (unless you divide by zero).
Therefore, if the sum from any fixed number to infinity converges, then the sum from 1 to infinity converges.

You can choose any fixed number you like. I chose 3 because 0<log(n) < n for all n>=3.

You can choose 11 if your log is base 10 rather than natural, or because, you know, usual amps only go up to 10, but yours goes all the way up to 11.

The sum from 3 to infinity of your series is smaller than the sum from 3 to infinity over 1/n^(p+1), which is smaller than 1/n^2 which we know converges.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 17 ·
Replies
17
Views
5K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
5K
  • · Replies 37 ·
2
Replies
37
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K