Proving Convergence: Bounded Sequences and Absolute Convergence Test

  • Thread starter Thread starter Bellarosa
  • Start date Start date
  • Tags Tags
    Convergence
Bellarosa
Messages
47
Reaction score
0
1. Prove that if a sequence (bn) is bounded and the sum |(an)| going from n= 1 to infinity converges, then the sum of the product of sequences (an)(bn) converges.



Homework Equations





3. Given that the sequence bn is bounded it is convergent, and by the absolute convergence test if the sum of the absolute value of the sequence (an) converges then so does the sum of the sequence of (an), therefore the sum of the product of the sequences an and bn converges.
 
Physics news on Phys.org
A bounded sequence is not necessarily convergent.
 
Oh yes that's true. So can I say that the sum of the product of a bounded sequence times a convergent sequence will be convergent? I'm assuming that the bounded sequence bn times the convergent sequence an will make the sum of their product convergent
 
Bellarosa said:
Oh yes that's true. So can I say that the sum of the product of a bounded sequence times a convergent sequence will be convergent? I'm assuming that the bounded sequence bn times the convergent sequence an will make the sum of their product convergent

Sure you can 'say that'. Anybody can 'say that'. Aren't you supposed to 'prove that'? I would think about setting up a comparison test...
 
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