Math 138: Assignment 6

due Friday, June 26, 2015 at 12:00 pm

 
1000  n 1  1
1. (a) Show that if n > , then   < .
9 3n + 1 3 1000
   
 n 1   3n (3n + 1) 
 3n + 1 3  =  3(3n + 1) 
   
 
 1 
=  
9n + 3 
1
=
9n + 3
1000
since n is positive. Now, since n > , then 9n > 1000 and 9n + 3 > 1003.
9
1 1 1
Therefore, < < , as required.
9n + 3 1003 1000
 
1  n 1 
(b) Given  > 0, if n > , show that   < .
9 3n + 1 3 
 
 n 1  1
 3n + 1 3  = 9n + 3


as in part a).
1 1 1 1 + 3 1
Since n > , then 9n > and 9n + 3 > + 3 so 9n + 3 > so <
9    9n + 3

<  as required.
1 + 3
(c) What did we prove in part b)?
 
n 1
We proved that the sequence whose nth term is has limit L = .
3n + 1 3
2. (a) Use the definition of the limit of a sequence to prove that the sequence {en } has
limit L = 0.
Using the definition of the limit or a sequence: Given  > 0, find K such that
|en L| <  for all n > K.
Since we think L = 0, we substitute this into the statement above and solve for
n.

|en 0| < 
|en | < 
en <  since en > 0
n < ln 
n > ln 

If we take K = ln , then we see that given any  > 0, |en 0| <  for all
n > K and so the sequence {en } has limit L = 0.
 n2 1
 
(b) Use the definition of the limit of a sequence to prove that the sequence
2n2 + 3
1
has limit L = .
2
Choose any  > 0.
 2 
 n 1 1 
 2n2 + 3 2  < 

 2
 2n 2 (2n2 + 3) 

 <
 4n2 + 6 
 
 5 
 4n2 + 6  < 
 

5
<
4n2 + 6
5 < 4n2  + 6
5 6
n2 >
r 4
5 6
n>
4
r  2 
5 6  n 1 
If we take K = , then  2  <  for all n > K and so the sequence
 2  4 2n + 3 
n 1 1
2
has limit L = .
2n + 3 2
3. Find the limit of the sequence whose nth term is given below. (Note: You do not need
to use the formal definition of the limit of a sequence here. You may use limit laws
and results of the sequence as function theorem).
ln(2 + 3n )
 
2
(a) an = (Hint: Begin by showing that ln(2 + 3n ) = n ln 3 + ln 1 + n ).
2n 3
x
ln(2 + 3 )
Let f (n) = an . Then f (x) = .
2x
Using the hint, we rewrite f (x) as
  
x 2
ln 3 1 + x
ln(2 + 3x ) 3
=
2x 2x 
x 2
ln 3 + ln 1 + x
3
=
2x 
2
x ln 3 + ln 1 + x
3
=
2x
Now, taking the limit as x , since we have an indeterminate form of type

, we use LHopitals Rule:

(2)3x ln 3
 
2
x ln 3 + ln 1 + x ln 3 +
3 1 + 32x
lim = lim
x 2x x 2
2 ln 3
ln 3 x
= lim 3 +2
x 2
ln 3
=
2
ln 3
By the sequence as function theorem, since limx f (x) = and f (n) = an ,
2
ln 3
then limn an = .
2
sin 2n
(b) an =
1+ n
sin 2x
Let f (n) = an . Then f (x) = , where x 1.
1+ x
We know that 1 sin 2x 1 for all x.
1 sin 2x 1
Then, , since x > 0.
1+ x 1+ x 1+ x
1 1
Since lim = 0 and lim = 0, then by the Squeeze Theorem,
x 1+ x x 1+ x
sin 2x sin 2n
lim = 0. By the Sequence as Function Theorem, lim = 0.
x 1 + x n 1 + n
4. Let {an } be the sequence defined recursively by
1
a1 = 2 an+1 = (an + 6), n = 1, 2, 3, . . .
2
Show that {an } is an increasing sequence that is bounded above by 10 and find its
limit.
We will first show that an+1 an for all n = 1, 2, 3, . . ..
1 1
When n = 1, we have a1+1 = (a1 + 6) = (2 + 6) = 4.
2 2
Since a2 = 4 2 = a1 , then the statement is true for n = 1.
Assume the statement is true for n = k. That is, ak+1 ak , for any positive integer
k > 1.
We must show ak+2 ak+1 .
Note that

ak+1 ak
ak+1 + 6 ak + 6
1 1
(ak+1 + 6) (ak + 6)
2 2
ak+2 ak+1

Thus, the sequence is increasing.

Now we will show that the sequence is bounded above by 10. That is, an < 10 for all
n = 1, 2, 3, . . ..
 When n = 1, we have a1 = 2 < 10 and the statement is true.
Assume the statement is true for n = k. That is, ak < 10, for any positive integer
k > 1.
We must show ak+1 < 10.
Note that

ak < 10
ak + 6 < 10 + 6
1 1
(ak + 6) < (16)
2 2
ak+1 < 8 < 10

Thus, the sequence is bounded above by 10.

By the Monotonic Sequence Theorem, the sequence is convergent.
Denote L = lim an . Note that L = lim an+1 .
n n

L = lim an+1
n
1
= lim (an + 6)
n 2
1
= ( lim an + 6)
2 n
1
= (L + 6)
2
L
= 3
2
L = 6

The limit of the sequence is L = 6.

 
1 50
5. Define the sequence a1 = 50, an+1 = an + , for n = 1, 2, 3, . . ..
2 an
(a) Show that an+1 an 50 a2n .

an+1 an
 
1 50
an + an
2 an
 2 
an + 50
2an
an
a2n + 50 2a2n
50 a2n

(b) Show that the sequence is decreasing. (ie. Use induction to show that 50 a2n
for all n = 1, 2, 3, . . ..)
For n = 1, we have a21 = 502 = 2500 50, so 50 a21 .
Assume statement is true for n = k, where k is a positive integer k > 1.
That is 50 a2k .
 Now we will prove the statement holds for n = k + 1.
  2
2 1 50
ak+1 = ak +
2 ak
 
1 2 2500
= ak + 100 + 2
4 ak
 
1 2 2500
= 50 + ak 100 + 2
4 ak
 2
1 50
= 50 + ak
4 ak
50

(c) Use the monotonic sequence theorem to show that this sequence converges.
Since an > 0 for all n, then the sequence is bounded below by 0. Since it is
decreasing and bounded below, the sequence in convergent by the monotonic
sequence theorem.

(d) Show that this sequence converges to 50.
Suppose the sequence converges to L. Since lim an = L, then lim an+1 = L.
  n n
1 50
Since an+1 = an + , then we have
2 an
 
1 50
lim an+1 = lim an +
n n 2 an
!
1 50
= lim an +
2 n lim an
  n
1 50
= L+
2 L
 2 
1 L + 50
L =
2 L
2 2
2L = L + 50
L2 = 50

L = 50

Sincethe sequence is always positive, we can reject the negative value of L. Thus,
L = 50.

(e) Write out the first five terms of this sequence as estimates for 50 as a fraction.
 Writing out the first five terms of this sequence, we have

a1 = 50
 
1 50 51
a2 = 50 + =
2 50 2
 
1 51 50 2801
a3 = + 51 =
2 2 2
204
 
1 2801 50 9926401
a4 = + 2801 =
2 204 204
1142808
 
1 9926401 50 163833943056001
a5 = + 9926401 =
2 1142808 1142808
22687948016

6. Determine if the following series converge or diverge. In the case of a convergent series,
find the sum of the series.

n
X
(a) cos (n) 3
n=0

X 3n+2 + 2 5n+1
(b)
n=0
42n

X n 22n
(c) 5 e
n=1

(a) We have that

n n
X X
cos (n) = 3 (1)n 3
n=0 n=0
 n
1
X
= 3

n=0

 1
n
X
Since  3  > 1 we have that cos (n) 3 is a divergent geometric series.
 
n=1

(b) We have that

 n+2
3n+2 + 2 5n+1 2 5n+1

X X 3
= +
n=0
42n n=0
42n 42n

9 3n 10 5n
X 
= n
+
n=0
16 16n
  n  n 
X 3 5
= 9 + 10
n=0
16 16

 n  
X 3 3
Consider 9 . Since   < 1, this is a convergent geometric series whose
n=0
16 16
 n
9 144 X 5
sum is 3 = . The series 10 is also a convergent geometric
1 16 13 n=0
16
  n
5 X 5 10 160
series since < 1. We have that 10 = 5 = . Thus, we get
16 n=0
16 1 16
11

X 3n+2 + 2 5n+1
that 2n
converges and
n=0
4

 n X  n
X 3n+2 + 2 5n+1 X 3 5
= 9 + 10
n=0
42n n=0
16 n=0
16
144 160
= +
13 11
3664
=
143

(c) We have that


X n 22n X  n1 2(n1)
5 e = 5 5 e
n=1 n=1

n1
X 5
= 5 2(n1)
n=1
e
!n1
X 5
= 5
n=1
e2

5
Now since 2 < 1 we have that the geometric series converges and
e

X n 22n 5 e2 5
5 e = =
5 e2 5
n=1 1 e2