MT1810 Number Systems: January 2015 Test

All four questions should be attempted

1. (a) Let f : X → Y be a function. Recall that f is surjective if for all y ∈ Y

there exists x ∈ X such that f (x) = y.
(i) What does it mean to say that f is injective?
(ii) What does it mean to say that f is bijective?
(b) Let X = {x ∈ R : 0 ≤ x ≤ 2}, let Y = {y ∈ R : 0 ≤ y ≤ 4} and let
f : X → Y be the function defined by
(
1 − x if 0 ≤ x < 1
f (x) =
4x − 4 if 1 ≤ x ≤ 2.

(i) Sketch the graph of f .

(ii) Is f injective? Justify your answer.
(iii) Is f surjective? Justify your answer.
(iv) Is f bijective? Justify your answer.
(25 Marks)

2. (a) Find all solutions in C to the following equations, writing the solutions
in the Cartesian form a + bi where a, b ∈ R.
(i) (1 + i)z + 1 = 2 − i,
(ii) z 3 = −1. [Hint: if r, s ∈ R>0 and θ, φ ∈ R then reiθ = seiφ ⇐⇒
r = s and θ = φ + 2nπ for some n ∈ Z.]
 
(b) Define a function f : C → C such that {z ∈ C : f (z) = 0} = 5 and
{z ∈ Q : f (z) = 0} = 1.
(25 Marks)

3. (a) Write down the truth table for implication =⇒ .

(b) Let P and Q be propositions. Which of the following are tautologies?
You must justify all your answers.
(i) (P =⇒ Q) ⇐⇒ (¬P ∨ Q),
(ii) (P =⇒ Q) =⇒ (Q =⇒ P ),
(iii) (¬P =⇒ P ) =⇒ P .
(c) Let R be the proposition (∀m ∈ N)(∃n ∈ N)(n is divisible by m2 ).
(i) Find a proposition logically equivalent to ¬R that starts (∃m ∈ N).
(ii) Is R true? Justify your answer.
(25 Marks)

TURN OVER
4. The addition table for Z5 is shown below.

+ [0] [1] [2] [3] [4]

[0] [0] [1] [2] [3] [4]
[1] [1] [2] [3] [4] [0]
[2] [2] [3] [4] [0] [1]
[3] [3] [4] [0] [1] [2]
[4] [4] [0] [1] [2] [3]

(a) Write down the multiplication table for Z5 .

(b) Calculate [1]4 + [2]4 in Z5 .
(c) Does the equation [x]4 + [y]4 = [2014] have a solution with [x], [y] ∈ Z5 ?
Justify your answer.
(25 Marks)