Determining convergence, monoticity and possible bounds

Click For Summary

Homework Help Overview

The discussion revolves around determining the convergence of the sequence defined by x(sub n) = n/2^n. Participants are exploring whether the sequence is monotone increasing or decreasing and identifying any bounds that may exist.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • The original poster attempts to use induction to show that the sequence is monotone decreasing and is bounded below by zero. They express uncertainty about their manipulation of inequalities and the validity of their induction approach.
  • Some participants suggest alternative methods, such as simplifying the inequality using properties of exponents and exploring recursive relationships.
  • Questions arise regarding the sufficiency of visual observations to prove convergence and bounds.

Discussion Status

Participants are actively engaging with the problem, offering insights and alternative approaches. While some progress has been made in establishing the monotonicity of the sequence, there is still uncertainty about formal proofs and the best methods to demonstrate convergence and bounds.

Contextual Notes

The discussion includes concerns about the manipulation of inequalities and the application of mathematical concepts such as the binomial theorem and the squeeze theorem. There is an acknowledgment of the original poster's confidence issues regarding their approach.

Nerpilis
Messages
19
Reaction score
0
my problem is to determine if a sequence is convergent by deciding on wether its monotone increasing or decreasing, and to identify a bound if it exists. given x(sub n) = n/2^n.

first I pluged in n values and found that as n gets bigger x(sub n) gets smaller and appears to go to zero. so I know I want to show/prove that the sequence is monotone decreasing and is bounded by zero. by induction i find that when n=1 , x(sub n)= 1/2. and i have x(sub n+1)= (n+1)/2^(n+1).

(this is about where i start to feel less confident, I'm not sure if I'm using induction properly and also on my next step I'm stuck on manipulating the inequality).

now I have x(sub n+1) < x(sub n). substituting and rearanging the inequality I get:
[(n+1)/2^(n+1)]-[n/2^n]<0
[(2^n)(n+1)-(n)(2^(n+1)]/(2^n)(2^(n+1))<0

This is where I am stuck, my strong points do not lie with manipulating inequalities with variables in the exponets (any links or suggestions to help me view examples of tricks of the trade here are welcome) also is this sufficient enough to state that it has a lower bound and the lim n/2^n = 0 as n goes to infinity?
 
Physics news on Phys.org
Do you know that 2^(n + 1) = 2 * 2^n? Hence

(n + 1)/2^(n + 1) < n/2^n
<=>
(n + 1)/(2 * 2^n) < n/2^n

and you can cancel 1/2^n from both sides, leaving something which is very easy to prove.
 
wow ok that is very clever, it was staring at me the whole time and i missed it. now i have the inequality to show:
(1-n)/(2)(2^n)<0<n/2^n for n>1 then that would definitely make x(sub n+1)<x(sub n) thus proving monotone decreasing convergence. I know that this sequence's limit is zero and is bounded by zero but I' not sure how to 'prove' it besides just looking at it and saying it goes to zero.
 
If you know the binomial theorem, you can use that to estimate 2^n (i.e (1 + 1)^n), and then use the squeeze theorem...

But a more elementary approach is to find a recursive formula relating x_(n + 1) to x_n. If you take limits on both sides of the recurrence equation, everything should fall out nicely.
 
Last edited:

Similar threads

  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K