Tuteri

al
sheet​-
2.

ca)
' {an bo} n is. Cendegent, if {ang na, is egt.
Take {an}=1 cat sego
{bn} = ". but {an.bn}nal dat is not egt.

{an} = {1} cat a {bn} = { b } bounded

but {an Go} = { b} is not cato

+
3

. 223
+50+ ​7 J

E
le
lan -= 1 0202+5077
Talle 172 +39 +
5 l 3 € £ 1 2 3 50e71
202 +50+71
2002=
 Yo.

At G​o

can-ekt uns no
& lan-e kth. Nowe lan-tice iff
I SE
= ņY​E
kanan choose / no=1 / theng .
Choose no sit : lantlce
A
P
R

& nyno
nyo ​MP
Qoy ​lim ​t ​zo ​if ​pro ​let​. ​Ero​.
Nowel ​op ​Olse
Biff ​n ​p ​> ​2
ny ​(​4​) ​YP ​By ​AP​.​R​. ​I ​no ​en ​sot
no​> ​(​22 ​p​. ​- 15 oct 20 & no, no

le
t
let an= bln.
Y
n
Висот
for nEN
s minal no
Ţ no sot 4 no Y no 1
6
o
an=1tbn.
anoch ​Not
possible
O

(an) = (1+byn
l
possibe
a
n
= It n bnt n. (ny) (by?
tai

in
in
> It m.bu​t menu ​(bn)2
> It m_​6​99-​1​660)3
 ‫‪p> ? (bn)2‬‬
‫‪= (bn) 2 < 2 ​Os‬‬
‫‪(bn)? <20 ​- bn‬‬
‫‪conneges to o‬‬
‫‪n‬‬
‫ﭘﻢ‬

‫ﻣﻠﯽ ای ران و‬
‫)رﺑﺪ ‪٩١‬ﮐﯽ )‪​ ) - (5‬ﻟﯽ(‬
‫‪B‬‬
‫‪int=sr‬‬
‫اﻛﻼت‬

‫اﺣﺘﺠﺒﺖ‬

‫ﻣﺎﻟﯽ‬
‫)ر از د )د‬
‫اور ﺟﺴﻢ‬

‫)‪5 + 1+ 4‬‬

‫س‬
‫ے‬
‫ﮦوﺋﯽ‬
‫ﭘﯽ‬
‫ﺳﺎ‬
‫‪( yeeze‬‬
‫)ا ‪1‬‬
‫‪-‬‬
‫ک ‪ -‬ﭘﻮل‬
‫اﺳﺖ‬
‫‪-‬‬
‫‪త‬‬

‫ﻣﯿﺮا‬
‫ﻫﻬﻬﻪ‬

‫‪-‬‬
‫‪tivata‬‬
‫‪in‬‬

‫اب ان‬
‫‪.‬‬
‫== ==‬
‫‪- ::‬‬
‫‪:: - ::‬‬
‫‪.-‬‬
‫|=( )ام‬
of na 1, noth nothing to prove il pf:s
= 1t xa
n
net for noi, nal -
- - - 4 x (2 + (‫اس( )ره‬
14 : ‫ أوﻻ‬+ =
=
Ala st+t
1
290
Man​zana
EST​SWOT

-
Play

Ina
5 (n+1) + (n+1) 71
‫ܡܫܡܩܝܕܕܟܙ‬

ки“
nelit
C​ha​n​g)
15w
LO
pou l 5(1​3 ​+ them to the

as not as
we get
(using algebra of

(ii)
For
ocach
x n=
ah+ + 6+)
auton

Instan () + 1)
6" (​C​)*+v​)

36​( ​)
(+
Hine qes
 (%) -30

=
6.
It
xu
2
If ​ro ​show
tha
t
i ​nal
lim
no

!
same
work
for ​Ye​.

les
If 221 fooof is same. ​If
ockcl. tol they do
ein (1) = ​consider, b )
= {ans.it
 Hana It bon. ​. an
conveye to 1.
nyo

ntos

lim
1
=1

-
li
m
r
=
1
hyo

no tnEN.
so
a
s
 n
o
.
a
s
n to iff
1
xn
ano
nas​i

Pro
of
Firs
t
ano
=
I to a

le
t
Eyo be
giv
en
x
n
 soto
I noen
t miro
1
N
o
w
h
e
ga
s
lentymianom.
tas y Anyno
-0
Choose t =
YM.
tet ​1 ​to
gium ​an
let ​Myo ​be ​any ​I ​to ​Veto
real ​No​.
I ​no​.
En
go
to
 an

< ​e
f ​mno

-
Į & ​no​, ​no

choors
e
an​> ​M​=​£ ​yo ​an​>​M ​V
no​, ​no

xno

o ​If ​ana​, ​bnb​.

fan<bn. &NEN. Prone that acb.
First we will prove that anyo to
fant x = x>,o. let xco for ginen
Ero. I no EN foto a
S pen-alt & no, no
x-Ec xn catt & no, no Now choose E= -
+ 70
. xn <a
 whic
h
i
s
contradiction
.
le
t
cn = an-anyo.
ľ positive term sequence..
i sesos will conveye
Qol
g
an
=
{1+4)"},

a $0, 2, 0, 2,--}. ​O oscillating

series. ​2​013. ©
Xin = 6 + + + + - + b for
Dzl. Bonded). <1+1+1+ Iz te bote

anti-dn
 =
in t))!

(и Слаа

Xintaano
monotonically

He
nce
it is
converent
o

ntos
lim an = ? o lim ( 1+ 2 +
12+
1 - 2 ) = e.
nyo

an= (+ 3)" for nal.

í same as question. 3
a
y
li
m
 =
e
3
lim (it 3
nyos
nso

=
li
m
39*3.
hyn lt
5
6
Thi
s
will work
i
n
th
e
simila
r
= es
Quls
 ©
Чт
о
en ​+ ​\ ​} (​ ​xn ​+
​ nt ​en ​= 2 Cap + 2 ) xb.
)​. a
= Bab - { *)

30 on 1 & E70,
nti

.
for no=YE:

3n2+
1
Th
e
1 + one s HCC
2n

was
3n2t
 3ntl

Choose no
bot.
n
a
/
​ {sent,
P​O_
ewhere
xn = ob tJ + 6+2
+-
+ bin is
gl
o
mto
ņ
n+2
+​1

‫ *​ ﺣﻼ ﮨﻤﺎرا ﭘﯿﺞ‬Woh
ant-en = (statt ut at
&
tal

et I + Sint
T
n+2

2ntl anta
 nti

-
2 month - 2 (nt)

=
2​(n+1) – ​(n+​1​)
2(2n​+1)(n+
1​)
8 (20+​))
(0​+1)

»
Hen
ce
Anti-kn zo
monotonical
ly
increasing.

-+.
tan
xn- tot to t
totn
bt|
m
+
 1
m
+2

<
P

en <i to..
Hence bounded: Hence {un's is
monotonically
increas

bouded seg.
He
nce
connegent
o
Qo13 ​. ​(​An​= ​(​t ​I​)​" ​is convejente

Consi
der
tl
positi
ve
tern
y
L
nt
nti
 n
time
s

since
.
A
o
M
7
Go
M​.

mtu

ntl

to
itt​, ​itt
th​'
Intl ​positive
consid
en
tems
Ju
-
n ​times
 y ​ntl

A​.​M​. ​7 ​GoM​. ​(​+)​n ​+

, ​(​(​1​+​+​)
n
+
1

(​n+​1​)
D​&​D
n​(​n​+​1​)
minti ​> ​[​144​]​Pou
1​+ ​Motive ​> (​1​+​1 )
​ ​+

22 ​ñ
2
n​!
hn
antly ​an ​Hence ​monotonically
" ​Tincreasing
ges​}​= (1++) = 1+ neto + (​nt) ​2 + n(nt)-- II
<H1++ (1-)+ - C-56-3)
 < 4+1 + i + -
itititi ​taya
Q​115 ​@
li
m
​ ​+ ​La
II
T
(​mt​)​)
2
+ ​--' ta
() 2​) ​=
(22T
.

le
t
an -
1 t t ta tt ​n​2
♡+n)
2

ot!
B<ntl.
5>
1
 +)
2
since nth can <ht
(2092 ​Take cn = nt & bn = nt
n<nto
n2

(20)
tanto o
- lim en zo
& lim bn=o.
-
0

nto
nto

5
0 < a < b)
=
m
m =0,
nys

lim Cohann + Share t

Considen ans tone that it
noo
) - tabia
 tn
Joan < an c.

take con 2 min = D . f boa parte

lim cn=1 & lim bn=l. Mence by

squeene theorem
nyos
​ a ​Itt ​+​&​+
X n
-
+b.

anti-en
intl
incea

rence
monotonically
increasing.
no
lunce

ant van

n​o
alepo
-
 Cau
chy
Criteri
a
& Ero. 7 OREN. Sot
& n, mono.
lan-am ct

choo
se
n=ano
& mano
zno
3 ​t​a
deno

uzno – Xnol = 11+ftit hot hott zno

- (1+5 + 5 + d
).

notno
ano'
not
A not2
oxx

1X200 - Xno) >

Yemen
 contradiction.

Hen
ce
it is
unbound
ed

Hen
ce
i
f is
diveyent
o

​
72
CHAPTER ​3 ​SEQUENCES ​AND
SERIES
23
40
for ​p
2​5

TY
Jarp

152 ​<​+1 < ​2 for all n € N. This fact has

been verified for n = 1. Suppose that it is
true for ​n = ​k; then 2 3 27​4 ​<22x+<4,
whence it follows (why?) that

1<V2​5 2​+1 = ​27 ​ . ​< ​24+2 ​=

​ ​4​+1 ​</​4 = 2. ​[In this last step we
22
have used Example 2.1.13(a).] Hence the
validity of the inequality 1 5 ​Z​x
< 2+1 < 2
implies the validity of 1 < 2+1 ​<2​2+2 <
2. Therefore 1 S2: ​<2​+1 <​2 ​for all n €N.
Since ​Z = ​(2x) is a bounded increasing
 sequence, it follows from the Monotone
Convergence Theorem that it co​nverges to a
number ​z := sup(2.). It may be shown directly
that sup(2) = 2, so that z=2. Alternatively
we may use the method employed in pant
(a). ​The relation 2,+1 ​= ​2​2, ​g​iv​es a
relation between the nth term ​of the
1-tail 2, of Z and the ​nth term of Z. By
Theorem 3.1.9, we have lim Z​=​z= lim Z.
Moreover, by Theorems
3​.2.3 and 3.2.10, it follows that the limit z must
satisfy the relation
42.
d

Z=1​2​2.

Hence z must satisfy the equation z​* = 2z

which has the roots z = 0,2. Since the ​terms of ​z=
(2) all satisfy ​1 <​2<2, it ​follows from Theorem
3.2.6 that we must ha​ve 1 szS2. ​Therefore ​z ​=
2​.
GOURROIOS

The Calculation of Square Roots We

now give an a​pplication of the Monotone
Convergence Theorem to the calculat​i​on
of ​square roots of positive numbers.
TOS

o​n​vergen

39

Sequence

3.3.5 Example L​et a > 0; we will

construct a sequence (s) of real
numbers that con ​verges to ​Va.
Lets, > O be arbitrary and define ​sh​t1
:= (s, +​a​/​s) f​ or ​n e
​ N. ​We now show
that ​the sequence (s ) converges to ​va.
​ his process for calculating square
(T
roots was known in Mesopotamia befo​re
1500 B.C.)
We first show that sm > ​a f​ or n > 2.
S​inc​e ​s, s​a​t​isfies the quadratic
equation​s ​2snt/5​, ​+a = 0, this
e​quation has a real root. Hence the
discrimina​nt 482 +1 - 4a must be
nonnegativ​e; that is, sati ​> ​a forn > 1.
To see that (s) is ultima​tely
decreasing, we note that for n > 2
we have
7

sa - Satz = s, - į ​(s​ . + ) ​=​. 60-​a​)

20.
LAR

Hen​ce, spti SS, for all n > 2. The

Mono​tone Convergence Theorem
implies that s :​= ​lim(s) exists.
Moreover, from Theorem 3​.2.3, the
l​imits must satisfy the relation
s={(s+).
whence it follows (why?) that s = ​a/s or​ s
= a. Thus $ = ​va.
For the p​urposes of calculation, it is often
important to have an estimate of ​how rapidly
the sequence (s) converges to ​Vā. A ​ s
above, we have ​va ​ <
​ s, for all
n 2, whence it ​follows that ​a/s​ ​Sva ​SS.
Thu​s we have

05​8,​- ​Vas​ s​, ​-a/​s​, ​= (​ s​* -​a)/​ s

​ .
f​or n22. ​Using this inequality we
can calculate ​Ja t​ o ​any desired
degree of accuracy.