Worked out examples using Cauchy criterion for series

  • Thread starter Thread starter michonamona
  • Start date Start date
  • Tags Tags
    Cauchy Series
michonamona
Messages
120
Reaction score
0
Hello everyone,

Can anybody suggest a website that has worked out examples using the Cauchy Criterion for Series? or, if your feeling ambitious, work out the following problems below:

1.
\sum^{\infty}_{n=1}1/n

2.

\sum^{\infty}_{n=1}1/(n(n+1))The reason why I'm asking for this is because our textbook introduces the theorem (Steven Lay) but it does not demonstrate its usage. I have also perused the web and was not able to find a complete demonstration.

I only need to see it being used. The problems above are not homework questions. I promise.

I appreciate your help

M
 
Physics news on Phys.org
Check here for a review of the test and for reference to the variables I am referring to; http://en.wikipedia.org/wiki/Cauchy's_convergence_test.

Basically the trick is finding suitable values for m and n that make sure s_m - s_n can not be smaller than epsilon. This can be done in many ways but there's no systematic method. One way is to try to compare it to another series. The first example is a well known proof.

1 + 1/2 + (1/3 + 1/4) + (1/5 + 1/6 + 1/7 + 1/8) + (1/9 + ...+ 1/16) + (1/17+...+ 1/32) ... continually grouping them into groups of 2^n terms, you might want to investigate what each group must be larger than.

In terms of Cauchy, you are investigating s_{2^n} - s_{2^{n-1}}.
 
Thank you for your reply.

What do you mean by grouping them into 2^n groups?
 
michonamona said:
Thank you for your reply.

What do you mean by grouping them into 2^n groups?

Think he means groups of (1/2)^n terms

ie

1 + 1/2 + (1/3 + 1/4) + (1/5 + 1/6 + 1/7 + 1/8) + (1/9 + ...+ 1/16) + (1/17+...+ 1/32) ...

>

1 + 1/2 + (1/4 + 1/4) + (1/8 + 1/8 + 1/8 + 1/8) + (1/16 + ...+ 1/16) + (1/32+...+ 1/32) ...

And note that s2n-1 = n+1 for the second sequence of partial sums

Then think about convergence tests you know
 
Being a fool I made it harder than it had to be! Simpler case to look at is m=2n.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top