Student iD 2748295 I

Feedback Exercise 3 .

NI .
Suppose I <x , 2 and
define a
sequence (Xn) , recursively by xnx= 15-2 for nx1 .

show that <Xn- 1 for IN

3
a) all ne .

it's
We can solve this using proof by induction as
defined recursively .

that is true all positive integers neIN

3 x, 2 is true ... we can assume In for .

5
consider Anti Tr-2
,
Xn+- z = -

2-
(Xn+i ) -
=

3xn -2
-

I xn> and xn+ <

n
=> Xn+ = meaning (xn+1 -

3)2> 0
023xn
7
-

2 -

1
2 +

3 xn

3x
I
Returning original equation
Ant
the
:

to

yet we know 3xn :

meaning Xnx

To
prove
the
upper
bound :

Xax-2
=

/Ta-2-2 .

as Xn=2 and Xn+ Xn

=

Xn+
<
Xn+1'2 >14-2
↳

Xn + 1 42

by proof by induction the statement ZXnx* 2 is true for all nEINI

b) Show that (Xn) =,

is increasing .

If the sequence is
increasing
->
Xnx
-

Xn >
O for all neN .

Anti-Xn= -2
-

Xn
,
Xn12
:
Anti-Xn= 2 -

Xn
= 0
-

Thus Xn<Xn+1 ,
So the
sequence (Xn)n=1 is
increasing .

C .
Snow (Anlin converges ,
and compute limn = co
Xn .

As (Xn)= , is
increasing and bounded above :

Xn = 2
,
it
converges by the monotonic
convergence theorem to a limit L

we have L2 , Sequence Xn+-> L and 32-2<0

, properties of limits give L =
152

eatise nee
e solutionis-2

Determi
o
only

92 .
the
The series is eventually positive : we can use the comparison or the ratio test .

Suppose there exists some

interger K S t O an=
.
bu for all n .

If ba converges
then E ,
an
converges .

· isn- h for all n,

To determine if In converges or
diverges we can use the ratio test .

let Xn =
t

,
them
-

mint-man < ,
for all ne IN

Hence converges by the ratio test

By the ratio test an In converges

:
by referring back to the comparison test with ocisn
we can show that as
converges =>
in converges
Q3 .
a) Explain why it ,
I ** dx for each neN .

Student iD
:

2718295I

S4dx = Inx

->
In
*
dx =
(Inx]
=

In (log(x) log(y) 10g()

-

for al neN>0
,
In converges to 0 as n 0 .

By the Sandwich rule (an(nbn ,

Cr-1 as n ->
c) .
We can take a =
0 then a <Cn-br .

As nic ,
In 1 -> -
,
and let Cr= 1 ,
then as t -O as n - x we show that < In

o Int and hence

it: I** dx

b)
Define a
sequence /tal=1 by tn= /E=, I)-log(n) .
Show it is decreasing and o ? An = I for all n .

Itn) = 1 is
decreasing if and only if for
,
alr neIN
,
tn tn+1 .

Int=12 i)-logIntil

log -
, ,
from tnxtn+=> tn-Ent o

-log(n) -

+ ,
+

log(n+1/
=>
Yog( * 1- nt ,
+
i from part (a)
,
we know
log') - it, and :

log)-nt+ 0
: decreasing .

when us
- then GrIt1I and logIn/zo for ou nN than tr=157 ,) Groce nex

ErE I I > O
always ... In is bounded between O and I
meaning
:

O< treI .

c) does limes In exist ?

Why

the sequence (tn)n ,

is bounded 0 Itn11 and it is
decreasing /part b) .. the monotone
convergence theorem shows

that
En) , converges to some limit Las n = 2 and hence limnt an exists .