You are on page 1of 1

Math 123.

1: Homework 2
Rafael N. Hernandez

General Directions: Write your answers in letter sized white paper. Use black non-erasable ballpen only. Do not consult
with anyone except your teacher.

1. Use the definition of convergence to show that 2. Consider the sequence {xn } that satisfies the
2
n xn
the sequence { n2 −n+10 } converges. recursive formulation xn+1 = 2 + 2, for n ∈ N, with
x1 = 8. Use the Monotone Convergence Theorem
Proof. Let ε > 0. Take N = max{10, d 1ε e}. Suppose to show that {xn } converges.
n ≥ N.

n2
2
n − n2 + n − 10
Proof. Using the formula, we know x2 = 6, so
n2 − n + 10 − 1 = n2 − n + 10

x1 − x2 = 2 > 0. Also, xn = 2xn+1 − 4 for all n ∈ N. We

n − 10
= 2
proceed by induction on n. Suppose xn − xn+1 > 0 for
n − n + 10

n − 10 n ∈ N. Then
<
n2
n 1 2xn+1 − 4 − xn+1 > 0
< 2 =

n n 2xn+1 − (xn+1 + 4) > 0
1
< ≤ε x
n+1

N xn+1 − +2 >0
2
2 2
n n
Then 1 is the limit of { n2 −n+10 }. So { n2 −n+10 } is xn+1 − xn+2 > 0
convergent.
Thus, {xn } is strictly decreasing. So {xn } is bounded
above by 8.

Note that x1 = 8 > 4. Suppose xn > 4. By induction on n,

2xn+1 − 4 > 4

2xn+1 > 8

xn+1 > 4

So {xn } is bounded below by 4. By the Monotone


Convergence Theorem, {xn } converges.

You might also like