0% found this document useful (0 votes)
206 views1 page

Department of Mathematics MTL 100: Calculus: Quiz 1 Solutions

This document contains solutions to two problems from a calculus quiz. The first problem proves that a sequence converges if and only if it is a Cauchy sequence. The second problem discusses the convergence of a recursively defined sequence and determines its limit. Specifically, it shows that the sequence is bounded, non-increasing, and convergent, with a limit of √a.

Uploaded by

asd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
206 views1 page

Department of Mathematics MTL 100: Calculus: Quiz 1 Solutions

This document contains solutions to two problems from a calculus quiz. The first problem proves that a sequence converges if and only if it is a Cauchy sequence. The second problem discusses the convergence of a recursively defined sequence and determines its limit. Specifically, it shows that the sequence is bounded, non-increasing, and convergent, with a limit of √a.

Uploaded by

asd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Department of Mathematics

MTL 100: Calculus


2016-17: Semester I
Quiz 1 Solutions
1. Prove that a sequence {sn } of real numbers converges to a real number if and only
if it is a Cauchy sequence.
[5]
Solution. Suppose {sn } is a convergent sequence with limit `. Let  be any positive real
number. Then there exists a positive integer N such that |sn `| <  whenever n > N .
[ 12 ]
Now
|sm sn | = |(sm `) (sn `)| |sm `| + |sn `| <  +  = 2
whenever m, n > N . Thus the sequence {sn } is Cauchy.

[1]

Conversely suppose {sn } is a Cauchy sequence. Let  be any positive real number. Choose a
positive integer N such that |sm sn | <  whenever m, n > N .
[ 21 ]
This implies, in particular, that sn < sm +  for all m, n > N . Hence sm +  is an upper bound
for {sn : n > N }, and so vN = sup{sn : n > N } sm +  whenever m > N .
[1]
But now vN  is a lower bound for {sn : n > N }, and so vN  inf{sn : n > N } = uN .
Therefore
lim sup {sn } vN uN +  lim inf {sn } + .
[1]
Since this holds for all  > 0, we have lim sup {sn } lim inf {sn }. Since lim sup {sn }
lim inf {sn } always holds, we have lim sup {sn } = lim inf {sn }. This implies the sequence {sn }
is convergent.
[1]

2. Let a > 0. Discuss the convergence of the sequence {sn } defined by



1
a
sn+1 =
sn +
, n 1, s1 > a.
2
sn
If the sequence converges, determine the limit of {sn }.

[5]

Solution. Observe that s1 > 0. Assuming sn > 0, it is clear from the recurrence that sn+1 > 0.
Therefore sn > 0 for each n 1 by induction. Since sn+1 is the arithmetic mean of sn and
a/sn and since the arithmetic mean is greater than or equal to the geometric mean, we have

that sn+1 a for each n 1. Hence the sequence {sn } is bounded below.
[2]
Thus

1
a
1
a
sn sn+1 = sn
sn +
=
sn
0,
2
sn
2
sn
since s2n a and sn > 0. Hence the sequence {sn } is nonincreasing.

[1]

Therefore the sequence {sn } is convergent.

[ 12 ]

If {sn } `, then taking the limit as n tends to on both sides of the recurrence gives
1
a
`+
.
2
`


`=
Thus `2 = a, so that ` =

a since ` > 0.

[1+ 12 ]


You might also like