4 MT181 problems

Please write your solutions on A4 paper, scan them and submit them as a single pdf document
on moodle (deadlines and instructions can be found on moodle).

If you want to give feedback about this worksheet to the lecturer (e.g., what problems you
found difficult/useful/interesting/fun), please write it on the first page of your solutions.

This worksheet counts towards the final mark for this course.

—————-

1. Prove by induction that 2n > 6n for all integers n such that n ≥ 5 .

2. Let the mapping f : [2, ∞) → R be given by f (x) = x2 − 4x − 1 for all x ∈ [2, ∞).
(a) Prove that f is injective.
(b) Prove that f is not surjective.

3. Let mappings fi : Z → Z be defined by

f1 (n) = (n + 3)2
n
f2 (n) = b1 − c
2
for all n ∈ Z.
(a) Prove that f1 is not injective.
(b) Prove that f1 is not surjective.
(c) Prove that f2 is not injective.
(d) Prove that f2 is surjective.

4. Consider the function f : (−∞, 3] → [1, ∞) defined by f (x) = x2 − 6x + 10.

(a) Prove that f is injective.

(b) Prove that f is surjective.
(c) Why is f bijective? (Answer in a single sentence.)
(d) Why does f have an inverse? (Answer in a single sentence.)
(e) Find the inverse function f −1 .

The problem below is a supplementary exercise. A model solution will

be given, but your solution will not be marked.
3
X j2
5. (a) Evaluate .
j=1
(2j − 1)(2j + 1)
n
X j2 n(n + 1)
(b) Prove by induction that = for all n ∈ N .
j=1
(2j − 1)(2j + 1) 2(2n + 1)