Solving Bounded Sequences Homework - How to Find Bounding Number

  • Thread starter Thread starter sara_87
  • Start date Start date
  • Tags Tags
    Bounded Sequences
Click For Summary

Homework Help Overview

The discussion revolves around determining whether specific sequences are bounded. The sequences in question include {an}=sqrt(n)/1000, {an}=(-2n^2)/(4n^2 -1), {an}=n/(2^n), and {an}=(ncos(npi))/2^n.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • Participants discuss the definition of bounded sequences and explore whether each sequence can exceed a certain value M. They consider specific examples and the implications of the sequences' behavior as n approaches infinity.

Discussion Status

Some participants are questioning the boundedness of the first sequence and are exploring the implications of the definition of bounded sequences. Others are suggesting approaches to analyze the remaining sequences by treating them as functions and considering their limits.

Contextual Notes

There is a mention of using the sandwich theorem for one of the sequences, and participants are also discussing the implications of the sequences not going below zero or exceeding certain values.

sara_87
Messages
748
Reaction score
0

Homework Statement


how do show whether the following sequences are bounded?
1) {an}=sqrt(n)/1000
2) {an}=(-2n^2)/(4n^2 -1)
3) {an}=n/(2^n)
4) {an}=(ncos(npi))/2^n


Homework Equations


i have to show whether the sequences are bounded by a number but i don't know how to find that number. for part (4) i have to use the sandwich theorem.


The Attempt at a Solution


1) it's not bounded since it will continue to increase to infinity.
but i don't know how to do the rest. can someone help please?
thank you very much
 
Physics news on Phys.org
If a sequence (a_n) is bounded then there exists an M > 0 such that |a_n| (< or =) M. On the other hand if a sequence is unbounded then for all M > 0 there exists an N such that if n > N, |a_n|> M.

Now, if I give you a number M can you show that each sequence will either (a) never exceed or (2) eventually exceed M? Think of a specific example first such as M = 100. Can, for instance, the first sequence ever exceed 100? What value of N would guarantee it?
 
Last edited:
oh okay
so for 1) the sequence will never go below 0 for all n so it is bounded right?
 
oh sorry
M>0?
then it is not bounded
 
For (2) and (3) replace n with x and think of them as functions. Do they achieve maximums/minimums? Do they have limits as x (i.e. n) -> infinity? For (4) use the fact that |cos(n pi)| = 1 for all integers n, and do the same.
 
Last edited:

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
Replies
18
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
6
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 3 ·
Replies
3
Views
3K