MA 1A (SECTION 1) MID-TERM SOLUTIONS

Problem 1. (40 points)

n n
k−1 1−x2
(1 + x2
Q
Let x 6= 1. For an integer n ≥ 1 show that )= 1−x
.
k=1

1−1 21 2
Solution. When n = 1, L.H.S. = 1 + x2 = 1 + x, and R.H.S. = 1−x1−x
= 1−x
1−x
= 1+x =
L.H.S. since x 6= 1.
r 2r
r+1
k−1 k−1
(1+x2 ) = 1−x (1+x2 ) =
Q Q
Assume that for some r ∈ N, 1−x
. When n = r+1, L.H.S. =
k=1 k=1
r r r r+1
2r+1−1 2k−1 r 2 12 −(x2 )2 1−x2
x2 ) 1−x
Q
(1 + x ) (1 + x ) = (1 + 1−x
= 1−x
= 1−x
= R.H.S. Therefore, by
k=1
n n
k−1 1−x2
(1 + x2
Q
induction, )= 1−x
for all n ∈ N.
k=1

Problem 2.
(a) (20 points) Show that the limit of a convergent sequence of integers is an integer.
(b) (10 points) Let (xn )n≥1 be a convergent sequence of rational numbers. Let qn be the
denominator of xn (when written in lowest terms). If the sequence (qn )n≥1 is a bounded
sequence of integers, show that there exists an integer N such that N · xn is an integer for
all n ≥ 1.
(c) (10 points) Under the assumptions of part (b) deduce that lim xn is a rational number.
n→∞

Solution. (a) Let (an )n≥1 be a convergent sequence of integers. Assume contrary, let the
limit be L ∈ R\Z. Then for all  > 0, there exists N ∈ N such that for all n with n ≥ N ,
|an − L| < . In particular, we can pick  = min{dLe − L, L − bLc} > 0. However, as an ∈ Z,
by the definition of ceiling and floor function, |an − L| ≥ dLe − L or |an − L| ≥ L − bLc, i.e.
|an − L| ≥  for all n ∈ N, contradiction. Therefore, L ∈ Z.
(b) Let a bound of (qn )n≥1 be M ∈ N, i.e. −M ≤ qn ≤ M for all n ∈ N. If N = M !, qn | N
for all n ∈ N, and hence, N · xn is an integer for all n ∈ N.
(c) Let L = lim xn . Then N L = lim N · xn , where N is the same as part (b). As (N · xn )n≥1
n→∞ n→∞
NL
is a convergent sequence of integers, by part (a), N L is an integer. Therefore, L = N
is a
fraction of integers with N 6= 0, i.e. rational.

Problem 3.
Let x ∈ (0, π2 ). Consider the sequence xn = sin(sin(· · · sinx)).
| {z }
n times
(a) (20 points) Is the sequence (xn ) monotonic?
(b) (20 points) Does it converge? If yes, find its limit; if not, show why that is the case.

Date: Fall 2011.

1
Solution. (a) For all x ∈ (0, π2 ), 0 < sin x < x < π2 .
When n = 1, x1 = sin x ∈ (0, π2 ). Assume that for some k ∈ N, xk ∈ (0, π2 ). When
n = k + 1, xk+1 = sin xk ∈ (0, π2 ). By induction, xn ∈ (0, π2 ) for all n ∈ N. As a result,
xn+1 = sin xn < xn for all n ∈ N. Therefore, the sequence is monotonic (decreasing).
(b) As the sequence is monotonic and bounded, it is convergent. Let L = lim xn . Then
  n→∞
sin L = sin lim xn = lim sin xn (since sin is continuous) = lim xn+1 = L, implying L = 0.
n→∞ n→∞ n→∞

Problem 4.
(a) (20 points) Show that if x > 0 is an irrational number, then lim bxnc = x, where bac
n→∞ n
represents the largest integer ≤ a.
(b) (20 points) Let f : (0, ∞) → R be an increasing function, i.e. f (x) < f (y) whenever
x < y. Show that the limit lim f ( bxnc
n
) exists.
n→∞

Solution. (a) For all  >

 0, by Archimedean
 principle, there exists N ∈ N such that N > 1 .
For all n with n ≥ N ,  bxnc − x = xn−bxnc < n1 ≤ N1 < .
 
n n
bxnc xn bxnc
(b) n
≤
= x, but
n  the equality case cannot hold since x is irrational, so n < x for all
n ∈ N. Hence, bxncn
is converging to x from the left. As f is an increasing function,
n≥1
the left limit lim− f (y) exists for all y0 ∈ R. Taking y0 = x, we have lim f ( bxnc
n
) exists.
y→y0 n→∞