Math 1432 Notes Week 9

!"#! % &'( )(*+& ,--(. /0,12 *3405

! is an !""#$ &'!() foi # if $ < ! foi all $ c #%

The *#+,- !""#$ &'!() of # is an uppei bounu that is less than oi equal to any othei uppei bounu
foi #%

)(*+& ,--(. /0,12 *3405
Eveiy nonempty set of ieal numbeis that has an uppei bounu has a &'()* uppei bounu.

Examples:

1. {1, 2, 3, 4} S =


2. |-4, 2j


S.
( ) ,8 !"


4.
( ) 5, !


S.
2
{ : 16} S x x = !


6.
1 1 1 1 1
1, , , , , , ,
2 3 4 5 1000
S
! "
=
# $
% &
! !


&'(0.(5 !"#!#6
If ! is the least uppei bounu of the set # anu c is a positive numbei, then theie is at least one
numbei ) in # such that ! -c + ) < !.

Example:

1 2 3 4
, , , , 0.01
2 3 4 5
S !
" #
= =
$ %
& '
!





&'(0.(5 !"#!#7
Eveiy nonempty set of ieal numbeis that has a lowei bounu has a ,-'(*')* lowei bounu.

Examples:

1. {1, 2, 3, 4} S =


2. |-4, 2j


S.
( ) ,8 !"


4.
( ) 5, !


S.
2
{ : 16} S x x = !


6.
1 1 1 1 1
1, , , , , , ,
2 3 4 5 1000
S
! "
=
# $
% &
! !


&'(0.(5 !"#!#8
If . is the gieatest lowei bounu of the set # anu c is a positive numbei, then theie is at least one
numbei ) in # such that . < ) + . + c.

Example:

1 1 1 1
, , , , 0.01
2 4 8 16
S !
" #
= =
$ %
& '
!
















)9: -;< =>!

1. uive the L0B of { } 9 :
2
< x x

A. S B. -S C. 9 B. -9 E. Theie is no L0B

2. uive the uLB of (!", 2]

A. u B. - ! C. 2 B. -2 E. Theie is no uLB


!"#6 +9?@9A:9B

A ,#.!#(/# /0 -'(& 12.3'-) is a ieal-valueu function uefineu on the set of positive integeis.

{ }
1 2 3 4
, , , ,
n
S a a a a a = = !



Examples:

1.
1 1 1 1
1, , , , ,
2 3 4 5
! =





2. 1, 4, 9, 16, . =




S.
2 3 4
, , ,
3 4 5
! =




4. u, 1, 2, S, 4, . =






Piopeities:

1.
{ }
1 2 3
, , ,
n
a a a a ! ! ! ! = !


2.
{ } { }
1 1 2 2 3 3
, , ,
n n
a b a b a b a b + = + + + !


S.
{ } { }
1 1 2 2 3 3
, , ,
n n
a b a b a b a b ! = ! ! ! !






Sequences can be bounueu oi unbounueu.



The sequence {(1} is saiu to be
415-'()41, if (1 + (1+1 foi all 1,
1/16'5-'()41, if (1 < (1+1 foi all 1,
6'5-'()41, if (1 7 (1+1 foi all 1,
1/1415-'()41, if (1 > (1+1 foi all 1.

A sequence that satisfies any of these conuitions is calleu ./1/*/145.

Examples:
Beteimine the bounueuness anu monotonicity of
{ }
n
a :
1.
2
1
n
! "
# $
% &







2.
( )
{ }
1
n
!









S.
{ }
1
2
n+








4.
( )
{ }
2 1
1
n
n
+
!









C9;D9EFGH

FREE!!!

http:www.geogebia.oig

Commanu foi sequence:

Sequence| (n, foimula), n, 1, 1uuj

Sequence| (n, foimula), n, stait, enuj

















)9: -;< =>!

3. Determine the boundedness and monotonicity of the sequence with a
n
as indicated.


a) decreasing; bounded below by 1 but not bounded above.
b) nonincreasing; bounded above by 81but not bounded below.
c) decreasing; bounded below by 1 and above by 81
d) decreasing; bounded above by 81 but not bounded below.
e) nondecreasing; bounded below by 1 and above by 81






1u.S )IJIKB ;L G +9?@9A:9

We aie conceineu with limits of sequences as n appioaches infinity.
A sequence that has a limit is saiu to be 5/18'-,'1*. A sequence that has no limit is saiu to be
648'-,'1*%

Eveiy conveigent sequence is bounueu anu eveiy unbounueu sequence is uiveigent


TBN 1u.S.6
A bounueu, nonuecieasing sequence conveiges to its least uppei bounu; a bounueu, nonincieasing
sequence conveiges to its gieatest lowei bounu.

Let L a
n
! anu M b
n
! as ! " n

i.
n n
a b + !
ii.
n
a ! "
iii.
n n
a b ! "
iv.
1
n
b
!

v.
n
n
a
b
!



Examples:
1.
!
"
#
$
%
&
2
1
n





2.
!
"
#
$
%
&
n 2
cos
'





S. { }
cos( ) n !




4.
!
"
#
$
%
&
'
n
1
4








S.
!
"
#
$
%
&
+1
2
n
n
















The Pinching Theoiem foi Sequences:
Suppose that foi all 1 gieatei than some integei 9, (1 < 31 < 51.
If (1 -> : anu 51 -> :, then 31 -> :

0ne iesult of the Pinching Thm:


Example:

!
"
!
#
$
!
%
!
&
'
(
)
*
+
,
-
+
2 /
1
1
n
n



































!"#8 4J<;FKGAK )IJIKBMM

n
n
x
/ 1
lim
! > "



If 1 < x ,
n
n
x
! > "
lim



!
n
n
1
lim
" > #




!
lim
n
x
n
n ! > "




n
n
n
ln
lim
! > "




n
n
n
/ 1
lim
! > "




n
n
n
x
!
"
#
$
%
&
+
' > (
1 lim














(NGJ<O9BH
State whethei the sequence conveiges as ! " n anu if it uoes, give the limit.
1.
!
"
!
#
$
!
%
!
&
'
(
)
*
+
,
-
.
n
n
2
1





2.
!
"
#
$
%
&
n
n!













3.
!
"
#
$
%
&
'
(
0
2
n
x
dx e











4.
!
"
#
$
%
&
+1
4
3
n
n






)9: -;< =>!
4. uive the limit (if it exists) of the sequence
!
"
#
$
%
&
+
2
2
n
n



A. V B. 1 C. u B. 2 E. BNE (uiveiges)


S. uive the limit (if it exists) of the sequence
!
"
#
$
%
&
+
n
n 1 2

A. V B. 1 C. u B. 2 E. BNE (uiveiges)