Mathematical Concepts G6012, 2012-10-01

cwk1-problems.pdf

c Dr. Thomas Nowotny

Introduction
This is coursework assignment 1, due Tuesday, 16 October 2012, 16:00 in the School Ofce of the School of Engineering and Informatics, Chichester I building, ground oor. Please work on this alone and do not plagiarise. If your solution is suspected of plagiarism or collusion it will be reported and investigated. If you would like to know more about academic (mis)conduct, refer to sussex.ac.uk/academicoffice/resources/ misconduct.

1 Calculating with complex numbers

1. Multiplication of two complex numbers. Multiply the following numbers and write the result in the form a + b i with two real numbers a, b R. (a) (2 + i) (5 i) = (b) (a + 3i) (a 3i) = (4 marks) (4 marks)

2. Division of complex numbers. Calculate the following and write the result in the form a + b i with two real numbers a, b R. (a) (b) 1i 1+i 2i 4i (4 marks) (4 marks)

3. Graphing complex numbers. Draw a pair of axes and mark the real part of the numbers on the x-axis and the complex part on the y-axis (like in lecture). Where are the following numbers located: (a) (b) (c) 5+i 5 5+i 5 5+i 5
2

(2 marks) (2 marks) (2 marks) 1

Mathematical Concepts G6012, 2012-10-01

cwk1-problems.pdf

c Dr. Thomas Nowotny

Can you describe in your own words what kind of shape you would get if you i n continued with 5+ for larger n and connected the points? (2 marks) 5

2 Sums and products

1. Calculate the following sums and products:
4

(a)
n=1 3

1 2 ij

(4 marks)

(b)
i=1 j =2 2 2

(4 marks)

(c)
k=1 l=1

k l

(4 marks)

2. Write the following as a sum in sigma notation: (a) 1 + 4 + 16 + 64 + 256 (b) 4 + 8 + 12 + 16 + 20 + 24 (4 marks) (4 marks)

3. Simplify the following expressions:

2n n

(a)
i=1 n

i
j =1 n1

2j

(4 marks)

(b)
k=1

k
j =2

(4 marks)

Mathematical Concepts G6012, 2012-10-01

cwk1-problems.pdf

c Dr. Thomas Nowotny

3 Proof by induction
Prove by induction the following claim:
n

n N :
i=1

3i 4 =

n (3n 5) 2

Make sure to write down the proof neatly in its nal form with three explicit steps. (20 marks)

4 Regular expressions
We will use the alphabet A = {a, b}. 1. Write down all strings that belong to the regular language dened by the following regular expressions. (a) a?b(ab)? (b) b(a|b)?b? (c) A?A? (4 marks) (4 marks) (4 marks)

2. Find short regular expressions that are matched by the following strings and only the following strings. (a) a, ab, abb (b) a, b, aa, ab, ba, bb (4 marks) (4 marks)

Mathematical Concepts G6012, 2012-10-01

cwk1-problems.pdf

c Dr. Thomas Nowotny

5 Finite state automata

We will use again the alphabet A = {a, b}. 1. Find the regular expression that describes the language that is accepted by this nite state automaton:

a q0 b q1

a q2 b b
(6 marks)

2. Draw a nite state automaton that accepts exactly the language described by the regular expression ab ba+. (6 marks)