You are on page 1of 9

~~MT2116 ZA d0

This paper is not to be removed from the Examination Halls

UNIVERSITY OF LONDON

MT2116 ZA

BSc degrees and Diplomas for Graduates in Economics, Management, Finance


and the Social Sciences, the Diplomas in Economics and Social Sciences and
Access Route

Abstract Mathematics

Tuesday, 26 May 2015 : 14:30 to 17:30

Candidates should answer SIX of the following EIGHT questions: THREE from Section
A and THREE from Section B. All questions carry equal marks.

PLEASE TURN OVER


University of London 2015
UL15/0323

Page 1 of 9

D1

SECTION A
Answer any three questions from this section.

1.(a)

Let S be the following statement about integers x:


S: If x is an odd integer, then there is an integer y such that x2 = 8y + 1.
(i) Prove the statement S.
(ii) Write down the converse of S.
(iii) Write down the contrapositive of the converse of S.
(iv) Prove that the converse of S is true.

(b)

(i) Prove that for any three sets A, B and C,


A (B \ C) = (A B) \ (A C).
(ii) Is it always the case that A (B \ C) = (A B) \ (A C)?
Justify your answer.

(c)

For statements p, q and r, prove that the three statements


(p q) = r, (q r) = p and p q r are equivalent.

UL15/0323

Page 2 of 9

D1

2.(a)

(b)

Prove by induction that, for all natural numbers n, n(n2 + 5) is a


multiple of 6.
For a positive real number a, let (an ) be the sequence given by a1 = a
an
. Prove by induction that, for all n N,
and, for n 1, an+1 =
an + 1
an =

(c)

a
.
(n 1)a + 1

Let f : (1, 1) R be given by


f (x) =

x
.
1 x2

Prove that f is a bijection and determine its inverse.

UL15/0323

Page 3 of 9

D1

3.(a)

For X = (0, ), let R be the relation on X with


x R y

x
Q.
y

Prove that R is an equivalence relation on X. Explain why Q is an


equivalence class of R.
(b)

Find the real number a such that z = i is a solution of P (z) = 0,


where P (z) is the polynomial
P (z) = z 3 z 2 + z + 1 + a.
For this value of a, find all solutions to the equation P (z) = 0.

(c)

Let a, b and c be positive integers, and let S be the set of all n N such
that n | a, n | b and n | c. (So, S is the set of positive common divisors of
the three numbers a, b and c.) Explain briefly why S must have a
greatest element. Suppose we denote this greatest element of S by
D(a, b, c). Prove that
D(a, b, c) = gcd (gcd(a, b), c) .
[Recall that gcd(x, y) denotes the greatest common divisor of x and y.]

UL15/0323

Page 4 of 9

D1

4. (a)

(b)

Find the greatest common divisor, d, of 261 and 66 and determine


integers x and y such that d = 261x + 66y.
Prove that, if a and b are integers, and 2a 2b (mod 22), then
a b (mod 11).
Find all solutions (if there are any) of the following system of
simultaneous equations in Z22 , justifying all your steps carefully.
9x + 2y = 11
4x 2y = 14.

(c)

For all R, prove that


1 + iei
= iei .
1 iei
Use this result to show that
 7

 
 7

 
+ i cos
i 1 + sin
i cos
= 0.
1 + sin
7
7
7
7

UL15/0323

Page 5 of 9

D1

SECTION B
Answer any three questions from this section.
5.(a)

What does it mean to say that s is the supremum of a non-empty set of


real numbers ?
Let S be a non-empty set of positive real numbers such that, whenever
x S, then also x + x1 S.
Show that S is not bounded above.
Hint: show that, if s

1
s

< x s, then x +

1
x

> s.

(b)

State the Extreme Value Theorem and the Intermediate Value


Theorem.

(c)

Let f : [0, 1] R be a continuous function such that f (0) < f (1).


(i) Let S = {f (x) | 0 x 1}.
Show that S is an interval of the form [a, b].
(ii) Show that there exists c [0, 1] such that

f (c) f (1) = f (0) f (1) c.

UL15/0323

Page 6 of 9

D1

6.(a)
(b)

Define what it means for a sequence (an ) to converge to L R.


Define a sequence (an ) of real numbers by
a1 = 1

and

an+1 =

a2n
+ 1 for every n 1.
4

Show that 0 < an < 2 for every n N.


Explain why lim an exists and find its value.
n
You may use any results from the course, provided they are clearly
stated.
(c)

Suppose that (bn ) is a convergent sequence with limit B, (cn ) is a


convergent sequence with limit C, and B > C. Let (dn ) be the sequence
defined for every n N by
dn = max{bn , cn },
where max{x, y} = x for x y, and max{x, y} = y for x < y.
Show that (dn ) is convergent, with limit B.

(d)

Suppose that f : R R and g : R R are functions that are both


continuous at 1, with f (1) > g(1). Let h : R R be the function
defined by
h(x) = max{f (x), g(x)}, for all x R.
Show that h is continuous at 1.
You may use any results from the course, provided they are clearly
stated.

UL15/0323

Page 7 of 9

D1

7.(a)

Let (G, ?) be a group with identity element e, and let (H, ?0 ) be a group
with identity element e0 .
What does it mean to say that a function : G H is
a homomorphism ?
What are the kernel and the image of a homomorphism ?
Show that, for any homomorphism : G H, we have (e) = e0 . Also
show that, for any element g G, (g 1 ) = ((g))1 .

(b)

Let (G, ?), (H, ?0 ), and (K, ?00 ) be groups, and suppose that : G H
and : H K are homomorphisms.
Show that the composition : G K is a homomorphism.

(c)

Let C denote the set of non-zero complex numbers, and R the set of
non-zero real numbers.
Explain briefly why (C , ), where is the usual multiplication, is a
group, and why (R , ) is a subgroup of (C , ).
Show that the function : C R defined by (a + bi) = a2 + b2
(where a and b are real numbers) is a homomorphism. Find the kernel
and the image of .

UL15/0323

Page 8 of 9

D1

8.(a)
(b)

Define what is meant by the order of an element of a group.


Let (F, ) be a group.
(i) Show that if x F has infinite order then, for every positive integer
m, xm has also infinite order.
(ii) Show that if x F has a finite order n then, for every positive
integer m dividing n, xm has order n/m.

(c)

What does it mean to say that a group is abelian ?


Let (G, ?) be an abelian group. Prove that, for every positive integer n
and all a, b G, we have an ? bn = (a ? b)n .

(d)

Let (G, ?) be an abelian group with identity e, and let n be a fixed


positive integer. Show that the set {a | an = e} is a subgroup of G.

END OF PAPER

UL15/0323

Page 9 of 9

D1

You might also like