MT1810 Number Systems: January 2014 Test

All four questions should be attempted

1. (a) The diagram below shows a function f : {1, 2, 3, 4} → {1, 2, 3}.

f
1•
•1
2•
•2
3•
•3
4•

(i) Is f injective? Justify your answer.

(ii) Is f surjective? Justify your answer.
(iii) Is f bijective? Justify your answer.
(b) Let X = {x ∈ R : x ≥ 0}, let Y = {y ∈ R : 0 ≤ y < 1} and let
g : X → Y be the bijective function defined by
x
g(x) = .
1+x
(i) Give a formula for g −1 (y) for y ∈ Y .
(ii) Sketch the graphs of g and g −1 , making it clear how they are related.
(iii) Simplify g −1 g(x) for x ∈ X and g g −1 (y) for y ∈ Y .

(25 Marks)

(a) (i) No, since f (1) = f (4). [2 + 2 marks]

(ii) Yes, since for all y ∈ {1, 2, 3} there exists x ∈ {1, 2, 3, 4} such that f (x) = y.
[2 + 2 marks]
(iii) No, since f is not injective. [2 + 1 marks]
(b) (i) We have g −1 (y) = x ⇐⇒ g(x) = y ⇐⇒ x/(1 + x) = y ⇐⇒ x = y + xy ⇐⇒
x(1 − y) = y ⇐⇒ x = y/1 − y. Therefore
y
g −1 (y) = .
1−y

[6 marks]
(ii) See below. Note reflective symmetry about the dashed line y = x. The horizontal
asymptote of g(x) at y = 1 and the vertical asymptote of g −1 (y) at x = 1 are indicated
by dotted lines.
 2

3/2
( g ( x ), x )

1/2 ( x, g( x ))

0 1/2 1 3/2 2

[4 marks]
(ii) g −1 g(x) = x and g g −1 (y) = y (no calculation required).



[2 + 2 marks]

2. (a) Express (1 + i)2 and (1 + i)3 in both Cartesian and polar forms.
(b) Find all solutions z ∈ C to the equation z 2 −4z +4−2i = 0 in Cartesian
form.
(25 Marks)
√
(a) (1 + i)2 = 2i = 2eiπ/2 , (1 + i)3 = −2 + 2i = 2 2e3iπ/4
[(2 real + 2 imag + 1 mod + 2 arg) + (2 + 2 + 1 + 2) marks]
(b) We have

z 2 − 4z + 4 − 2i = 0 ⇐⇒ (z − 2)2 = 4 − 4 + 2i
⇐⇒ (z − 2)2 = 2i
⇐⇒ z − 2 = ±1 + i
⇐⇒ z = 2 ± (1 + i)

where the third step uses that (1 + i)2 = 2i, as seen in (a).
So the solutions are z = 3 + i, z = 1 + i. [7 (method) + 1 + 1 + 1 + 1 marks]

3. (a) Find q, r ∈ Z with 0 ≤ r < 119 such that 425 = 119q + r.

(b) Use Euclid’s Algorithm to find gcd(425, 119).
(c) Determine the prime factorizations of 425 and 119.
(25 Marks)

(a) 425 = 3 × 119 + 68 so q = 3 and r = 68. [3 + 3 marks]

(b) The first step was done in (a), so we have

425 = 3 × 119 + 68
119 = 1 × 68 + 57
68 = 1 × 57 + 19
57 = 3 × 19

Hence gcd(425, 119) = 19. [6 (method) + 4 marks]

(c) By (b) we know that 19 is a prime factor of 425 and 119. Division shows that
425 = 52 × 19 and 119 = 7 × 19. [3 + 2 + 2 + 2 marks]

4. Consider the relation ∼ defined on Z by

x ∼ y ⇐⇒ x − y is even and x ≥ y

(a) Is ∼ reflexive? Justify your answer.

(b) Is ∼ symmetric? Justify your answer.
(c) Is ∼ transitive? Justify your answer.
(25 Marks)

(a) Yes, since x − x = 0 is even and x ≥ x for any x ∈ Z. [3 marks + 6 marks]

(b) No, since 3 ∼ 1 but 1 6∼ 3. [3 marks + 3 marks]
(c) Yes: suppose that x ∼ y and y ∼ z. Then x ≥ y and y ≥ z so x ≥ z. Moreover x ≡ y
and y ≡ z mod 2, and since congruence modulo 2 is an equivalence relation, x ≡ z mod
2. Hence x − z is even. [3 marks + 7 marks]