Bonus Questions - Sheet 4
Bonus Questions - Sheet 4
By applying Bernoulli’s inequality to the left hand side, verify this inequality for
all n > |x|.
(b) Show that an ≤ an+1 ≤ bn+1 ≤ bn for all n > |x|.
(c) Deduce that (an ) and (bn ) converge to the same limit as n → ∞.
5. Fix c > 0.
√
(a) Let a0 = a, a > 0, and inductively define an+1 = (an +c/an )/2. Show that an → c.
(b) Let a0 = a, 0 < a < 2/c, and inductively define an+1 = an (2 − can ). Show that
an → 1/c.
[Remark: These are both examples of the Newton-Raphson iteration method for solving
equations, in the first case x2 = c and in the second case 1/x = c. Once you get close
to a solution they converge very rapidly.]
√
n
6. (a) For any fixed x > 0, show that the sequence 2n ( 2 x − 1) converges as n → ∞.
√
n
(b) Defining ℓ(x) = limn→∞ 2n ( 2 x − 1), show that ℓ(xy) = ℓ(x) + ℓ(y) for all x, y > 0.
[You should not make use of any properties of the logarithm for this question. It may
help to prove (a) for x > 1 first, then do (b) and conclude (a) for x > 0.]
√
7. Show that for any L ∈ [−1, 1] there exists a subsequence of the sequence sin n such
√
that sin nk → L as k → ∞. [You may assume sin an → sin α when an → α.]