Technische Hochschule Ingolstadt Ulrich Schlickewei

Mathematics 2
Winter term 2021/22

Exam preparation – sheet 3: sequences October 28, 2021

Exercise 1

Determine the parameter c ∈ R such that the limit of the sequence

(4n + c)(cn + 4)
an =
2n2 + 18
is 42.

Sketch of solution:

• First we simplify the fraction:

(4n + c)(cn + 4)
an =
2n2 + 18
4cn2 + 16n + c 2 n + 4c
=
2n2 + 18
2
4cn (16 + c 2 )n + 4c
= +
2n2 + 18 2n2 + 18
2
4cn (16 + c 2 )n + 4c
= +
2n2 + 18 2n2 + 18
2
4cn (16 + c 2 )n + 4c
= 18

+
2n2 1 + 2n 2 2n2 + 18
1 (16 + a2 )n + 4c
= 2c · 9
+ 2 + 18
.
1+ n2 | 2n {z }
→ n → ∞0
| {z }
→ n → ∞ 2c

• Apparently, the first summand converges to 2c while the second one converges to 0. Thus,

lim an = 42 ⇐⇒ c = 21.
n→∞

Exercise 2

Show that for two positive real numbers x,y > 0:

p
lim n
x n + y n = max{x,y }.
n→∞

Sketch of solution:
 • We will define a sequence cn which converges to max{x,y } and we will show that max{x,y } ≤ an =
√
n
x n + y n ≤ cn . Using the “squeeze theorem” this is enough to prove the claim of the exercise.
Without loss of generality we assume that x = max{x,y }.
• We observe that x n + y n ≥ x n (because y n ≥ 0). Using the monotony of the root function we get
p √
n
n
xn + yn ≥ x n = x.

• On the other hand, because of y ≤ x we infer that y n ≤ x n . This implies that x n + y n ≤ 2x n , thus
p √
n
√
n
n
xn + yn ≤ 2x n = x 2 = cn .
√
n
√
n
Because of limn → ∞ 2 = 1 (see lecture notes) we obtain limn → ∞ cn = limn → ∞ x 2 = x.
• Summarizing, we have √
n
x ≤ an ≤ cn = x 2.
Lower bound as upper bound both converge to x, thus also an converges to x = max{x,y }.

Exercise 3

The mathematician Leonardo Fibonacci investigated the following problem:

A pair of (newly born) rabbits are put in a field. They are able to mate at the age of one month
so that at the end of the second month the female can produce another pair of rabbits. All
descendants behave in the same way. How many rabbits are there after one year if no rabbit
dies?

(a) We define the sequence (fn ) which models the number of pairs of rabbits at the beginning of month
n. Give a recursive formula for fn .
fn+1
(b) We now define another sequence (an ) as an = fn
. Show that

1
an−1 = 1 + .
an−2

Use this to determine the limit of (an ) under the assumption that (an ) is convergent.

Sketch of solution:

(a) • At the beginning of months one and two there is exactly one pair, so f1 = f2 = 1.
• At the beginning of month three there is in addition to the first pair the pair of descendants, so
f3 = 2 = f2 + f1 .
• At the beginning of month four there are the f3 pairs of rabbits of month three and additionally the
descendants of the rabbits of month two, which already is able to mate, so f4 = f3 + f2 .
• We infer that in general we have the recursion formula

fn = fn−1 + fn−2 .

(b) • For the sequence (an ) we find

 −1
fn+1 fn + fn−1 fn−1 fn 1
an = = =1+ =1+ = 1 + (an−2 )−1 = 1 + .
fn fn fn fn−1 a n −2
• Under the assumption that (an ) is convergent with limit a, we deduce using the equality from
above: √
1 2 1± 5
a=1+ =⇒ a − a − 1 = 0 =⇒ a = .
a 2
√
1+ 5
• Since all elements of (an ) are positive, we must have a ≥ 0. Thus only a = 2
is possible.