Basic Computational Mathematics

Contents
1 Numbers and Sets ..................................................................................................................................... 3
1.1 Brief theoretical background ................................................................................................................ 3
1.2 Compulsory problems ............................................................................................................................ 4
1.3 Supplementary problems ...................................................................................................................... 5
1.4 Answers for Tutorial 1 ............................................................................................................................ 6
2 Relations ..................................................................................................................................................... 9
2.1 Brief theoretical background ................................................................................................................ 9
2.2 Compulsory problems .......................................................................................................................... 10
2.3 Supplementary problems .................................................................................................................... 11
2.4 Answers for Tutorial 2 .......................................................................................................................... 13
3 Relation schemes and Functions .......................................................................................................... 16
3.1 Brief theoretical background .............................................................................................................. 16
3.2 Compulsory problems .......................................................................................................................... 18
3.3 Supplementary problems .................................................................................................................... 19
3.4 Answers for Tutorial 3 .......................................................................................................................... 20
4 Boolean types, logic and quantifiers ................................................................................................... 21
4.1 Brief theoretical background .............................................................................................................. 21
4.2 Compulsory problems .......................................................................................................................... 22
4.3 Supplementary problems .................................................................................................................... 23
4.4 Answers for Tutorial 4.......................................................................................................................... 24
5 C.n.f, negation of quantifiers, proof and argument .......................................................................... 27
5.1 Brief theoretical background .............................................................................................................. 27
5.2 Compulsory questions ......................................................................................................................... 29
5.3 Supplementary questions.................................................................................................................... 30
5.4 Answers for Tutorial 5 .......................................................................................................................... 31
6 Vectors and complex numbers ............................................................................................................. 32
6.1 Brief theoretical background .............................................................................................................. 32
6.2 Compulsory questions ......................................................................................................................... 36
1
6.3 Supplementary questions.................................................................................................................... 37
6.4 Answers for Tutorial 6 .......................................................................................................................... 38
7 Matrices .................................................................................................................................................... 39
7.1 Brief theoretical background .............................................................................................................. 39
7.2 Compulsory questions ......................................................................................................................... 42
7.3 Supplementary questions.................................................................................................................... 43
7.4 Answers for Tutorial 7 .......................................................................................................................... 44
8 Computer graphics in 2D: Matrix transformations ........................................................................... 45
8.1 Brief theoretical background .............................................................................................................. 45
8.2 Linear transformations in 2D .............................................................................................................. 45
8.3 Compulsory questions ......................................................................................................................... 47
8.4 Supplementary questions.................................................................................................................... 47
8.5 Answers for Tutorial 8 .......................................................................................................................... 49
9 Elements of graph theory ...................................................................................................................... 51
9.1 Brief theoretical background .............................................................................................................. 51
9.2 Compulsory problems .......................................................................................................................... 53
9.3 Supplementary problems .................................................................................................................... 54
9.4 Answers for Tutorial 9 .......................................................................................................................... 55
10 Elements of number theory and cryptography ............................................................................... 56
10.1 Brief theoretical background ............................................................................................................ 56
10.2 Compulsory problems........................................................................................................................ 58
10.3 Supplementary problems .................................................................................................................. 58
10.4 Answers for Tutorial 10 ..................................................................................................................... 59
11 Elements of Calculus............................................................................................................................. 62
11.1 Brief theoretical background ............................................................................................................ 62
11.2 Compulsory problems........................................................................................................................ 64
11.3 Supplementary problems .................................................................................................................. 64
11.4 Answers for Tutorial 11 ..................................................................................................................... 65

2
1 Numbers and Sets
1.1 Brief theoretical background
This section briefly presents the theoretical aspects covered in the tutorial. For
more details please check the lecture notes.

Number systems
N ={0, 1, 2, 3, . . . } natural numbers (including zero) (1.1)
N+ ={1, 2, 3, . . . } natural numbers excluding zero (1.2)
Z ={..., −2, −1, 0, 1, 2, . . . } integers (positive and negative) (1.3)
m
(1.4)
Q ={q = : m ∈ Z, n ∈ N+} rational numbers (fractions) n
R ={a.b : a, b ∈ Z} reals - infinite decimals (1.5)
R ={x ∈ R : x ≥ 0}
+ (1.6)
√ (1.7)
C ={a + bi : a, b ∈ R}, i = −1 complex numbers.
Motivation of number sets Number sets appeared from the need to solve
various equations, and to have well defined operations. Polynomials that
generate solutions in the various number sets are

1. P(x) = x − 1 ⇒x = 1 ∈ N
2. P(x) = x + 1 ⇒x = −1 6∈ N, x ∈ Z
3. P(x) = 4x − 1 ⇒x = 1/4 6∈ Z, x ∈ Q
√
4. P(x) = 2x − 1 ⇒x = 2 6∈ Q,
2 x∈R
√
5. P(x) = x + 1 ⇒x =
2 −1 = 1 6∈ R, x ∈ C.

Fundamental theorem of algebra (Argand in 1806, Gauss 1816). Every non-

constant single-variable polynomial with complex coefficients has at least one
complex root (real coefficients and roots being within the definition of complex
numbers).

Definitions and notations

• set - collection of similar objects (numbers, symbols, etc)

• x ∈ A - element x is a member of set A

• U universe - contains all the elements of a kind

• ∅ - set containing no element

• B ⊂ A ⇔x ∈ B ⇒x ∈ A
• A = B ⇔B ⊂ A and A ⊂ B
3
 • P(A) - power set - set of all subsets of A

• A × B = {(a, b) : a ∈ A and b ∈ B} cartesian product

Ways to define sets

A ={0, 1, 2, 3} (enumeration)
B ={n ∈ N : 3 ≤ n ≤ 100} (ellipsis - just when obvious!!!)
C ={x = n2 : n ∈ N} (formula)
Other set properties

• finite or infinite

• ordered (any two elements are comparable) vs not ordered

Operations. For sets A and B taken from the universe U we define

• A ∩ B = {x ∈ U : x ∈ A and x ∈ B} (intersection)

• A ∪ B = {x ∈ U : x ∈ A or x ∈ B} (reunion)

• A \ B = {x ∈ U : x ∈ A and x ∈ / B} (difference)

• A∆B = (A \ B)S(B \ A) (symmetric difference)

• Ac = {x ∈ U : x ∈ / A} (complement)

• Alternative notations for set complement: (A)c =∼ (A) = {(A) = U \ A

1.2 Compulsory problems
These are problems anyone should know how to solve.
C 1.1. The set of all subsets of a given set A is denoted by P(A).

A = {a, b, c}, P(A) =?.

C 1.2. (Cartesian product problem) Find the cartesian product A × B = {(a, b) : a

∈ A and b ∈ B} of sets A = {1, 2, 3, 6} and B = {a, b, c}.

C 1.3. Let

A = {‘r‘, ‘e‘, ‘s‘, ‘t‘}

B = {‘r‘, ‘e‘, ‘l‘, ‘a‘, ‘x‘}
C = {‘s‘, ‘l‘, ‘u‘, ‘m‘, ‘b‘, ‘e‘, ‘r‘}

Find A ∪ B A∪C B∪C

A ∩B A ∩C B ∩C
A \ (A ∩ C) B \ (A ∪ C).

4
C 1.4. Let the Universe U = {0, 1, 2, 3, 4, 5, 6, 7} and let

D = {0, 1, 2}, E = {2, 4, 6}, F = {1, 3, 5, 7}.

Find D \ F, E ∩ F, E ∪ F and (F ∪ D)c.

C 1.5. a) List the elements of the following sets (enumerate or give a formula).

i) {x ∈ N+ : x is a multiple of
4} ii) {x ∈ Z : −2 ≤ x ≤ 3}

b) List the elements of the following sets (enumerate or give a formula).

A = {x ∈ N+ : x is prime}
B = {x ∈ N+ : x is even} C = {x ∈ N+
: x is odd}

D = {x ∈ N+ : x is a multiple of 6}

Are any of the above sets A, B, C or D subsets of one of the other sets? Write
down your answer using the notation ⊂.
c) Determine which of the following sets are equal

E = {0, 1, 2, 3}
F = {x ∈ N : x2 < 13}

G = {x ∈ N : (x2 + 3) < 2}
C 1.6. i) If A ⊆ C and C ⊆ B, does it follow that A ⊆ B
? ii) If A ⊆ C and B ⊆ C, what can you say about A
and B.

C 1.7. If A and B are subsets of the universe, show by constructing examples that
each of the following is true.

i) (A∆B)c = (A ∩ B) ∪ (A ∪
B)c ii) (A \ B)c = Ac ∪ B

C 1.8. Use Venn diagrams to show that the following pairs are logically
equivalent.

i) (A ∩ B) ∪ (A ∩ B)c = U(universal
set) ii) (Ac ∩ B) ∪ A = A ∪ B

1.3 Supplementary problems

These are problems are not part of the assessment.
5
S 1.1. (Cartesian product)
(a) Find A × B × C for the sets A = {1, 2, 3}, B = {a, b, c} and C = {a, b, c}. (b) If the
sets A, B and C have m, n and p (m, n, p ∈ N+) elements respectively, what is the
number of elements of A × B × C ?

S 1.2. Prove that if A, B, C are sets from the Universe U, then:

i) A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) (distributivity of ∩)
ii) A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) (distributivity of ∪)
iii) (A ∩ B)c = Ac ∪ Bc (de Morgan law for ∩)

iv) (A ∪ B)c = Ac ∩ Bc (de Morgan law for ∪).

S 1.3. Find the sets A, B with the properties

i) A ∪ B = {1, 2, 3, 4, 5, 6,
7, 8, 9, 10} ii) A ∩ B = {3,
4, 5} iii) A \ B = {2, 6}

S 1.4. Write the following numbers as fractions

i) x = 0.333 ··· = 0.(3)

ii) x = 0.23232323 ··· = 0.(23)
iii) x = 0.1129292929 ··· =
0.11(29)
√ iv) x= 3.
1.4 Answers for Tutorial 1
Compulsory problems

C 1.1. P(A) = {∅, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}}.

C 1.2. A×B = {(1, a), (1, b), (1, c), (2, a), (2, b), (2, c), (3, a), (3, b), (3, c), (6, a), (6, b), (6,
c)}.

C 1.3. A ∪ B = {‘r‘, ‘e‘, ‘s‘, ‘t‘, ‘l‘, ‘a‘, ‘x‘}; A ∪ C = {‘r‘, ‘e‘, ‘s‘, ‘t‘, ‘l‘, ‘u‘, ‘m‘, ‘b‘};
B ∪ C = {‘r‘, ‘e‘, ‘l‘, ‘a‘, ‘x‘, ‘s‘, ‘u‘, ‘m‘, ‘b‘}; A ∩ B = {‘r‘, ‘e‘}; A ∩ C = {‘r‘, ‘e‘, ‘s‘};
B ∩ C = {‘r‘, ‘e‘, ‘l‘}; A \ (A ∩ C) = {‘s‘, ‘t‘}; B \ (A ∪ C) = {‘a‘, ‘x‘}.

C 1.4. D \ F = {0, 2}; E ∩ F = ∅; E ∪ F{2, 4, 6, 1, 3, 5, 7}; (F ∪ D)c = {4, 6}.

C 1.5. a) i) {4, 8, 12, . . . } = {4n : n ∈ N+}; ii){−2, −1, 0, 1, 2, 3}.

6
 b) A = {2, 3, 5, 7, 11, . . . }(infinite set)
B = {2, 4, 6, 8, . . . } = {2n : n ∈ N+}
C = {1, 3, 5, 7, . . . } = {2n − 1 : n ∈ N+} = {2n + 1 : n ∈ N}
D = {6, 12, 18, . . . N+} = {6n : n ∈ N+} ⊂ B
c) E = F = {0, 1, 2, 3}.

C 1.6. i) yes; ii) nothing

If A = {2n : n ∈ N+} ⊂ C = N, B = {2n + 1 : n ∈ N+} ⊂ C = N) then A ∩ B = ∅. If A =
{2n : n ∈ N+} ⊂ C = N, B = {4n : n ∈ N+} ⊂ C = N) then B ⊂ A.

C 1.7. Let U = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} and let A = {0, 1, 2, 3, 4, 5}, B = {4, 5, 6, 7}.

i) (A∆B) = {0, 1, 2, 3, 6, 7}, (A ∩ B) = {4, 5}, (A ∪ B)c = {8, 9}

(A∆B)c = (A ∩ B) ∪ (A ∪ B)c = {4, 5, 8, 9}
ii) (A \ B)c = Ac ∪ B = {4, 5, 6, 7, 8, 9}

C 1.8. Use Venn diagrams to show that the following pairs are logically
equivalent.

i) (A ∩ B) ∪ (A ∩ B)c = U(universal set)

ii) (Ac ∩ B) ∪ A = A ∪ B

Supplementary problems

S 1.1. (b) mnp.

(a)A × B × C = {(1, a, a), (1, a, b), (1, a, c), (1, b, a), (1, b, b), (1, b, c), (1, c, a), (1, c, b), (1,
c, c),
(2, a, a), (2, a, b), (2, a, c), (2, b, a), (2, b, b), (2, b, c), (2, c, a), (2, c, b), (2, c, c),
(3, a, a), (3, a, b), (3, a, c), (3, b, a), (3, b, b), (3, b, c), (3, c, a), (3, c, b), (3, c, c)};

S 1.2. You may use the Venn diagrams where to show that both sides determine
the same region. Otherwise, we can use the following argument.
(i) Let x ∈ A ∩ (B ∪ C) then x ∈ A and x ∈ (B ∪ C). This means that x ∈ A and x ∈
B or x ∈ C. This means that x ∈ (A ∩ B) or x ∈ (A ∩ C).
For the proof to be complete one also need to start with a x from the right hand
side, and show that it belongs to the set at the left.

(ii) x ∈ A ∪ (B ∩ C) ⇔x ∈ A or x ∈ (B ∩ C). If x ∈ A, it clearly belongs to (A ∪ B)

and (A ∪ C), therefore to their intersection. If x ∈ (B ∩ C), it belongs to both
B and C, therefore to (A ∪ B) and (A ∪ C) and (A ∪ B) ∩ (A ∪ C).

7
 (iii) and (iv) - check with Venn diagrams.

S 1.3. One can use a Venn diagram to show that

A = {2, 3, 4, 5, 6}

B = {1, 3, 4, 5, 7, 8, 9, 10}

S 1.4. i) x = 0.333 ··· = 0.(3).

Multiplying by 10 we obtain 10x = 3 + x, which shows that x = .

ii) x = 0.23232323 ··· = 0.(23).

Multiplying by 100 we obtain 100x = 23 + x, which shows that x = .

iii) x = 0.1129292929 ··· = 0.11(29).

Multiplying by 100 the fraction becomes 100x = 11 + 0.(29) = 11 + .
In the end, we obtain x = .
√ iv) x= 3.

This is not a rational number. To prove this we assume there are two natural numbersp, q s.t they
have no common divisors and qp 2=
√ 3q2 and
= 3. This is equivalent to p
because p and q are natural numbers, p2 is a multiple of 3. This can only happen
when p itself is a multiple of 3, therefore p = 3p1. In this case, (3p1)2 = 3q2, which
gives 3p21 = q2. Using the same argument as before, q = 3q1. However, this
would mean that 3 is a common divisor of p and q, which is a contradiction. This
ends the proof.

8
2 Relations
2.1 Brief theoretical background
Notations and definitions

• A binary relation R is a triplet (X,Y, G), where G is a subset of X × Y,

• X - domain, Y - co-domain

• G - graph (we usually identify the relation R with its graph G!!!)

• If the pair (x, y) is in G (or R) we write xRy (x is in relation with y) or x

∼y

Operations on relations Let X, Y be sets, A ⊂ X, B ⊂ Y be subsets, and let R, S ⊂ X

× Y be two relations. The following operations are defined:

• R−1 = {(y, x) ∈ Y × X : (x, y) ∈ R} ⊂ Y × X (inverse)

• A C R = {(x, y) ∈ X × Y : (x, y) ∈ R and x ∈ A} (restriction)

• R B B = {(x, y) ∈ X × Y : (x, y) ∈ R and y ∈ B} (co-restriction)

• R(A) = {(y ∈ Y : there is a pair (a, y) ∈ R with a ∈ A} (image - this is a SET!)

• R ∪ S = {(x, y) : (x, y) ∈ R or (x, y) ∈ S} ⊂ X × Y (union)

• R ∩ S = {(x, y) : (x, y) ∈ R and (x, y) ∈ S} ⊂ X × Y (intersection)

Composition of binary relations Let R ⊂ X × Y and S ⊂ Y × Z be two relations.

S ◦ R = {(x, z) ∈ X × Z : there exists y ∈ Y with (x, y) ∈ R and (y, z) ∈ S}.

Special relations over a set

• reflexive: for all x ∈ X it holds that xRx

• symmetric: For all x, y ∈ X it holds that if xRy then yRx

• antisymmetric: For all distinct x, y ∈ X, if xRy and yRx then x = y

• transitive: For all x, y, z ∈ X, if xRy and yRz then xRz

• total: For all x, y ∈ X, it holds that xRy or yRx

• equivalence: a relation that is reflexive, symmetric and transitive.

9
N-arry relations Let n ≥ 2 and A1, . . . , An sets. A n-ary relation is a set R ⊂ A1 × ···
× An of n-tuples (a1, . . . , an) s.t. aj ∈ Aj, j = 1, . . . , n.
2.2 Compulsory problems
C 2.1. Let C be the set of characters and Y = {”apple”, ”pie”}. Find the define the
graph of the relation
APPEARS ⊂ C × Y
where (c, s) ∈ APPEARS if the character c appears in the string s.

C 2.2. A relation R ⊂ A × B, where A = {1, 2, 3, 4} and B = {‘a‘, ‘b‘, ‘c‘, ‘d‘} is

shown in the figure below. (i) Give R as a table; (ii) Give R−1 as a set of pairs.

Relation types

C 2.3. Let X = {1, 2, 3, 4}, Y = {A, B, C, D, E, F} and the relations

R ⊂ X × Y = {(1, A), (1, C), (2, A), (3, D), (4, D)}
S ⊂ Y × Y = {(E, A), (E, B), (B, D), (C, F), (A, F)}.

Calculate each of the following sets or relations:

(i){1, 2} C R (ii)S B {A, C, D} (iii)R({1, 2}) (iv)S ◦ R

(v )S ◦ S (vi)S ◦ S ◦ S (vii)R ◦ R−1

C 2.4. Suppose that T is a set of students, S is a set of sports, and LIKES ⊂ T × S is

a relation, as defined below

T = {Anne, Bill, Carol, Dave, Emma, Frankie}

S = {hockey, netball, tennis}
LIKES = {(Anne, tennis), (Anne, hockey), (Bill, tennis), (Carol, netball), (Dave, hockey)}.

If A = {Bill, Dave, Frankie} ⊂ T and B = {hockey, tennis} ⊂ S then find A C LIKES, LIKES B B
and LIKES(A).

C 2.5. Let A ⊂ X, B ⊂ Y be subsets, and R, S ⊂ X × Y be two relations. Prove that

10
 (A C R) B B = A C (R B B).
(2.1)
C 2.6. Let R ⊂ X × Y, S ⊂ Y × Z and T ⊂ Z × U be relations. Show that

(i) (S ◦ R)−1 = R−1 ◦ S−1

(ii) (T ◦ S) ◦ R = T ◦ (S ◦ R)
C 2.7. For each of the relations given below, decide whether or not it is:
(a) many-one; (b) one-many; (c) one-one; (d) onto;
The relations are
(i) R1 = {(s, t) ∈ S × S : s 6= ”” and t is the string s with its first character
deleted} (ii) R2 = {(c, s) ∈ C × S : LEN(s) ≥ 3 and c is the third character of
string s} (iii) R3 = {(s, n) ∈ S × N : s 6= ”” and n is the ASCII code of the first
character in s}.

C 2.8. Check whether the following relations R ⊂ X × X are

equivalences (i) X = N, (x, y) ∈ R if x = y.
(ii) X = R, (x, y) ∈ R if x ≥ y.
(iii) X = Z, (x, y) ∈ R if x is divisible by y.

2.3 Supplementary problems

S 2.1. Let X and Y be sets of cardinalities m and n respectively. What is the
minimum possible cardinality of relation R ⊂ X × Y ? What is the maximal
cardinality of R ?

S 2.2. Let X, Y be sets, A1, A2 ⊂ X, B1, B2 ⊂ Y be subsets, and let R, S ⊂ X × Y be two

relations. Prove that

(A1 ∩ A2) C R = (A1 C R) ∩ (A2 C R)

(A2 ∪ A2) C R = (A1 C R) ∪ (A2 C R)
R B (B1 ∩ B2) = (R B B1) ∩ (R B B2)
R B (B1 ∪ B2) = (R B B1) ∪ (R B B2)
R(A1 ∩ A2) = R(A1) ∩ R(A2)
R(A1 ∪ A2) = R(A1) ∪ R(A2)

S 2.3. Let STUDENTS be the set of students in a college, COURSES be the set of
courses the college runs, and SESSIONS be the set of sessions (such as: June 21,
a.m.) at which exam papers are taken. (Students may take more than one
course, and a course may have more than one exam paper.) Relations TAKING
and EXAM are defined as:

TAKING = {(s, c) ⊂ STUDENTS × COURSES : student s is taking course c}

11
 EXAM = {(c, d) ⊂ COURSES × SESSIONS : there is a paper for course c in session d}

Let F be the set of female students, and C the set of computing courses.
(i) Express in English each of the following:

(a) C C EXAM (b)EXAM(C) (c)EXAM ◦ TAKING

(d)EXAM−1 ◦ EXAM (e)EXAM ◦ (TAKING B C)

(ii) Using F, C, TAKING and EXAM and operations on binary relations, express
(a) The relation (s, c) where s is a female student taking the computing
course c.
(b) The set of courses with no female students.
(c) The set of exam sessions when the student ‘A107X‘ has a paper to sit.

S 2.4. HOBBIES is a relation which is defined below:

{(Sarah, painting), (Tom, painting), (Joe, football), (Janet, football),

(Susie, hockey), (Sarah, sketching), (Craig, sketching)}

and also, the following subsets are considered

Professional = {Joe, Sarah}

Amateur = {Susie, Tom, Janet, Craig}
Arty = {sketching, painting}
Games = {football, hockey}

Write down the following:

i) HOBBIES B Arty
ii) Professional C HOBBIES

iii) iii) Amateur C HOBBIES B Games

S 2.5. Let R ⊂ X × Y be a binary relation. Express in English each of the

propositions:

(i) ∀x ∈ X[∃ y ∈ Y[(x, y) ∈ R]]

(ii) ∀y ∈ Y[∃ x ∈ X[(x, y) ∈ R]]

S 2.6. Prove whether the following binary relations are equivalences. If the
relation is not an equivalence relation, state why it fails to be one.

(i) X = Z : a ∼ b if ab > 0.
(ii) X = R : a ∼ b if a − b is rational .
(iii) X = R : a ∼ b if a ≥ b.

12
 (iv) X = C : a ∼ b if |a| = |b|.
2.4 Answers for Tutorial 2
Compulsory problems

C 2.1. APPEARS =

C Y
‘a‘ ”apple”
‘p‘ ”apple”
‘l‘ ”apple”
‘e‘ ”apple”
‘p‘ ”pie”
‘i‘ ”pie”
‘e‘ ”pie”

C 2.2. (i)

1 ‘a‘
1 ‘b‘
2 ‘d‘
3 ‘b‘
4 ‘b‘

(ii) R−1 = {(‘a‘, 1), (‘b‘, 1), (‘b‘, 3), (‘b‘, 4), (‘d‘, 1)}.

C 2.3.

(i) {1, 2} C R = {(1, A), (1, C), (2, A)},

(ii) S B {A, C, D} = {(E, A), (B, D)},
(iii) R({1, 2}) = {A, C},
(iv) S ◦ R = {(1, F), (2, F)},
(v) S ◦ S = {(E, F), (E, D)},
(vi) S ◦ S ◦ S = ∅,
(vii) R ◦ R−1 = {(A, A), (A, C), (C, A), (C, C), (D, D)}.
C 2.4.

A C LIKES = {(Bill, tennis), (Dave, hockey)}

LIKES B B = {(Anne, tennis), (Anne, hockey), (Bill, tennis), (Dave,

hockey)} LIKES(A) = {tennis, hockey}. C 2.5. Both sides represent the set

(A C R) B B = A C (R B B) = {(a, b) ∈ R : a ∈ A, b ∈ B}. (2.2)

13
C 2.6. Let R ⊂ X × Y, S ⊂ Y × Z and T ⊂ Z × U be relations. Show that

(i) (z, x) ∈ (S ◦ R)−1 ⇔(x, z) ∈ (S ◦ R)

⇔∃ y ∈ Y s.t (x, y) ∈ R, (y, z) ∈ S
⇔∃ y ∈ Y s.t (y, x) ∈ R−1, (z, y) ∈ S−1
⇔(z, x) ∈ R−1 ◦ S−1
(ii) (x, t) ∈ (T ◦ S) ◦ R ⇔∃ y ∈ Y s.t (x, y) ∈ R, (y, t) ∈ T ◦ S
⇔∃ y ∈ Y, z ∈ Z s.t (x, y) ∈ R, (y, z) ∈ S, (z, t) ∈ T,
⇔∃ z ∈ Z s.t (x, z) ∈ S ◦ R, (z,
t) ∈ T, ⇔(x, t) ∈ T ◦ (S ◦ R).

C 2.7. (i) many-one; (ii) one-many; (iii) many-one.

C 2.8. (i) X = N, (x, y) ∈ R if x = y. Yes, because it is (a) reflexive: x = x; (b)

symmetric: x = y implies y = x (c) transitive: x = y, y = z implies x = z.

(ii) X = R, (x, y) ∈ R if x ≥ y. Not an equivalence, because it is

(a) reflexive: x ≥ x; (b) not symmetric (actually antisymmetric): x ≥ y does not
imply y ≥ x (ex. x = 3, y = 2) (c) transitive: x ≥ y, y ≥ z implies x ≥ z.

(iii) X = Z, (x, y) ∈ R if x is divisible by y. As above, it is not symmetric.

Supplementary problems

S 2.1. min = 0; max = mn.

S 2.2. One just needs to use the definitions of ∩, ∪, C, B and of the image of a
subset, and the double inclusion to prove the pairs of sets are equal.

S 2.3. (i) Express in English each of the following:

(a)C C EXAM = (c,d): there is a paper in computing c in the exam session d

(b)EXAM(C) = the sessions d having computing exams
(c)EXAM ◦ TAKING = (s,d) the students s taking an exam in session d
(d)EXAM−1 ◦ EXAM = (c,e) the pairs of courses c,e having a common session
(e)EXAM ◦ (TAKING B C) = (s,d) the students s taking computing exam in
session d

(ii) (a) F C TAKING B C; (b) TAKING(STUDENTS \ F);

(c) EXAM(TAKING( ‘A107X‘)).
S 2.4. The answer is

14
 i)HOBBIES B Arty = {(Sarah, painting), (Tom, painting), (Sarah, sketching), (Craig,
sketching)}
ii)Professional C HOBBIES = {(Sarah, painting), (Joe, football), (Sarah, sketching)}
iii)Amateur C HOBBIES B Games = {(Janet, football), (Susie, hockey)}.

S 2.5. (i) for all x in X, there is y in Y s.t. (x,y) is in R;

(ii) for all y in Y, there is x in X s.t. (x,y) is in R.

S 2.6. (i) X = Z : a ∼ b if ab > 0. Yes: reflexive, symmetric and transitive.

(ii) X = R : a ∼ b if a − b is rational. Yes: reflexive, symmetric and transitive.

(iii) X = R : a ∼ b if a ≥ b. No: reflexive, antisymmetric and transitive.

(iv) X = C : a ∼ b if |a| = |b|. Yes: reflexive, symmetric and transitive.

15
3 Relation schemes and Functions
3.1 Brief theoretical background
Notations and definitions
• Binary relation: subset R ⊂ X × Y.

• Inverse of relation R: R−1 ⊂ Y × X containing reversed pairs in R.

• Relation scheme: table with its column headings (called attributes). The
entries in the table are called ”tuples”.

• Key: Set K of attributes for relation R s.t.

1) no relation in R can have two tuples with the same values in K, but
different on some other attribute
2) no subset of K has a determining property

• Function between X and Y:

Definition 1): Relation between a set of inputs and a set of permissible
outputs s.t. each input is related to exactly one output.
Definition 2): relation R ⊂ X × Y s.t. for all x ∈ X, there is a single y ∈ Y s.t. xRy.

• Functions: X-domain, Y-codomain, y = R(x) ∈ Y - image of x.

• Types of functions: linear, quadratic, continuous, trigonometric, odd, even,

etc.

• Composition of functions (similar to relations): in general g(f(x)) 6=

f(g(x))!!!

Examples of functions
• Card : P(X) →N, Card(A) = nr of elements in subset A

• d : X × Y →R+, d(x, y) = distance between x and y

• Mark CM : Students in this room →[0%, 100%] (marks at Comp Maths)

• Functions defined on N × N →N: well defined (+, ×) and ill defined (−, /).

General properties of functions f : X →Y

• injective: different elements have different images

x1, x2 ∈ X : x1 6= x2 ⇒f(x1) 6= f(x2)

• surjective: all elements in co-domain are image of elements from the

domain.
y ∈ Y : there is x ∈ Xs.t.f(x) = y

16
 • bijective (1-on-1): a function that is both injective and surjective

• a function f only has an inverse f −1 if it is bijective!

Applications

• Theory of cardinals:
1) Two sets have same cardinal X ∼ Y if there is a 1-1 function between
them
2) Finite sets: same cardinal means they have the same number of
elements
3) Infinite sets: N ∼ Z ∼ Q - countable sets
4) R - not countable

• Datatypes (definition): A set, together with the basic defining functions.

• Datatype string:
1) Sets: C set of all characters, S set of all (ordered) sequences of
characters
2) Notation: ‘a‘ - character, ”string” - string
3) Functions defining the datatype string (all but LEN):

– LEN : S →N - number of characters in string s

– FIRST : S →C - selects the first character in string s The domain of FIRST

is S \ {” ”} (i.e. s is not an empty string).

– REST : S →S - deletes the first character from string s

The domain of REST is S \ {” ”} (i.e. s is not an empty string)

– ISEMPTY : S →{true, false} - checks whether a string is empty

– ADDFIRST : C × S →S adds character c at the front of string s

– STR : C →S - makes the string ”c” out of the character ‘c‘.

• Functions ASC and CHR (for characters):

– ASCII code (Definition): a number between 0 and 255 representing a

keyboard character on one byte (8 bit).
– ASC : C →{0, . . . , 255} converts a character to its ASCII code
– CHR : {0, . . . , 255} →C converts an ASCII code to the appropriate
character (inverse of ASC).
– Example: ASC(‘a‘) = 97, CHR(98) = ‘b‘.

• Special notations and operations

– +R, =N, <C, =s - operations defined on sets: R(real), N(natural), C(char),

S(string)

17
 – Example: =C is well defined when both inputs are in set C.
– >c: orders two characters by comparing their ASCII codes.
– +s concatenates two strings (”a” +s ”xe” = ”axe”)
3.2 Compulsory problems
When solving the problems one has to notice that the operations with index
(” +s ”, ” =c ”, ” =N ”, ” +R ”) refer to operations on the sets: S (strings), C
(characters), N (natural numbers) and R real numbers.

Make sure you understand the theory, before solving the problems!

C 3.1. Calculate ASC(x) +N 32 for x = ‘A‘ and x = ‘p‘.

Note: the apostrophe notation ‘h‘ denotes the character h, ”h” denotes the
string h.

C 3.2. Which of the following are true ? If false or invalid explain why.
(a) ‘a‘ <c ‘A‘; (b) ‘2‘ <c ‘Q‘; (c) 3 =c ‘3‘.
C 3.3. Which of the following are true, false (or invalid). Explain your decision.
(a) STR(‘c‘) =s ”c”; (b) ”d” =c ‘d‘; (c) ASC(‘c‘) ∈ C; (d) STR(ASC(‘b‘)) =s ”98”
C 3.4. Given s = ”Hal”, t = ”PRINCE” write down the following where
possible: (a) LEN(s); (b) LEN(t); (c) s +R t; (d) FIRST(s); (e) REST(t); (f)t +s s;
(g) t +s ‘s‘; (h) REST(s) +s ”ice”.

C 3.5. Find FIRST(”12345”) ; LEN(”takeaway”).

C 3.6. Evaluate the following where possible, or say if the expression is

undefined.
(a) ASC(‘D‘) +N
ASC(‘d‘) ; (b)
CHR(6.5); (c)
STR(‘H‘) ;
(d) STR(ASC(‘A‘)) ;
(e) REST(”Louise”);
(f) FIRST(”THELMA”);
(g) LEN(”time” +s ”out”);
(h) REST(REST(”frog”)); (i) FIRST(REST(”toad”));
(j) FIRST(REST(”K”));
(k) STR(FIRST(”frog”)) +s REST(REST(”Xi”));

C 3.7. Each of the following statements defines an element

IMPLICITLY. Say which element IS defined or whether there is no such
element and explain why.

18
or that there are many possible elements and describe
them. a) c ∈ S such that c +s ”ed” =s ”pushed”;
b) t ∈ S such that LEN(t) = 6;
c) r ∈ S such that LEN(r) = 0;
d) v ∈ C such that ASC(v) = 109 ;
e) w ∈ N such that LEN(w) = 1.
3.3 Supplementary problems
S 3.1. Find the domain and codomain of the following functions f : X →Y:

(c) X = [2, 4] and f(x) = x + 2

S 3.2. Define the function CAPITAL CONVERT : S →S that replaces a string by the
same string, with the first letter replaced by the upper case symbol for that
letter. i.e. fish →Fish, ada →Ada. Hint: Check the notations booklet to find the
ASCII codes of
lower and upper letters, and for the functions of datatype string.

S 3.3. State which of the following functions is injective, surjective or bijective:

a) f : R →R, f(x) = 2x + 3;
b) f : R →R, f(x) = 5;
c) f : R →R, f(x) = x2 − 2x + 3;
d) f : R →R+, f(x) = x2 − 2x + 1;
e) f : R+ →R+, f(x) = x2 − 2x + 1;
f) f : N →N, f(n) = 2n;
g) f : N →3N, f(n) = 3n; What can you say about the cardinals of N and 3N ?
h) f : N → Z, f(n) = n/2 (n even), and f(n) = −(n + 1)/2 (n odd).

19
3.4 Answers for Tutorial 3
Compulsory problems

C 3.1. ASC(‘A‘) = 65, ASC(‘p‘) = 112, therefore we have 97 and 144.

C 3.2. (a) false; (b) true; (c) invalid.

C 3.3. (a) true; (b) invalid; (c) false; (d) invalid.

C 3.4. (a) 3; (b) 6; (c) invalid; (d) ‘H‘; (e)

”RINCE”; (f) ”PRINCEHal”; (g) invalid; (h)
”alice”.

C 3.5. ‘1‘, 9.

C 3.6. (a) 68+100=168; (b) invalid; (c) ”H”; (d) STR(65) invalid;
(e) ”ouise”; (f) ”T”; (g) 7; (h) ”og” ; (i) ”o”; (j) FIRST(” ”) - invalid - the function is
only defined for non-empty strings; (k) ”f”+s” ”= ”f”.

C 3.7. (a) ”push”;

(b) any 6 character string;
(c) ” ”;
(d) ASC(‘m‘) = 109, so v = ‘m‘;
(e) w ∈ N is not a string, therefore LEN(w) is invalid.

Supplementary problems

S 3.1. (a) f(x) = x2: If X = R, then R+ ⊂ Y;

(b) f(x) = p(x): X ⊂ R+;

(c) X = [2, 4] and f(x) = x + 2: [4, 6] ⊂ Y.

S 3.2. The solution is: domain s ∈ S \ {” ”} and 97 ≤N ASC(FIRST(s)) ≤N 122,

codomain: t = ADDFIRST(CHR(ASC(FIRST(s)) −N 32), REST(s)).

Remark: five other functions ASC, CHR, FIRST, REST, ADDFIRST have all been
used to make the function CAPITAL CONVERT.

S 3.3. (a) bijective; (b) neither; (c) neither; (d) surjective; (e) bijective; (f)
bijective; (g) bijective; (h) bijective.

20
4 Boolean types, logic and quantifiers
4.1 Brief theoretical background
Boolean values: B = {true, false}

Boolean operations:
• NOT: ¬ : B →B (standard notation, some books may use ” ∼ ”)
• OR: ∨ : B × B →B

• AND: ∧ : B × B →B

• IMPLIES: ⇒: B × B →B

• EQUIVALENT: ⇔: B × B →B
p q ¬p p∨ q p∧ q p⇒q p⇔q
T T F T T T T
T F F T F F F
F T T T F T F
F F T F F T T
Equivalence between operations defined on boolean variables and set operations
Let A, B be two subsets of universe U and p and q be defined as

p(x) is true if and only if

x ∈ A q(x) is true if and only if x ∈ B • ¬p(x) is true
if and only if x ∈ Ac = {A =∼ A = U \ A.

• p ∨ q(x) is true if and only if x ∈ A ∪ B.

• p ∧ q(x) is true if and only if x ∈ A ∩ B.

Definitions:
• Sentence: statement that takes a value true or false.

• Proposition: sentence with no variables.

• Predicate: sentence which contains variables.

• Special predicates:

– Tautology: always true

– Contradiction: always false
De Morgan rules

(i) ¬(p ∧ q) = ¬p ∨ ¬q
(ii) ¬(p ∨ q) = ¬p ∧ ¬q
21
Disjunctive normal form (d.n.f)

Definition: Equivalent way of writing the truth table, using the variables i.e. p, q, ¬p,
etc.... first using ∧ , then using ∨ .

Figure 1: D.n.f using Truth tables and Venn diagrams

The d.n.f of H is

d.n.f(H) = (p ∧ q ∧ r) ∨ (p ∧ ¬q ∧ ¬r) ∨ (¬p ∧ ¬q ∧ r).

The corresponding regions in the Venn diagram: 7, 1, 2.

Quantifiers

• universal quantifier: ∀ for all

• existential quantifier: ∃ there exists

4.2 Compulsory problems
C 4.1. Write the negations for each of the following
statements a) John is six feet tall and he weighs at least
200 pounds.
b) The bus was late or Tom‘s watch was slow.

C 4.2. Construct a truth table for the

expressions (i) ¬(¬p∧ q).
(ii) (p∨¬q)∧ r
(iii) Construct a truth table for (p∧ q)∨ r and for (p∨ r)∧ (q∨ r) hence show that
these two statements are logically equivalent.
(iv) Check whether (p∨ q)∧¬r and (p∧¬r)∨ (q∧¬r) are equivalent.

C 4.3. For x ∈ R, suppose that p, q, and r are the propositions given below:

22
 p : x = −4 q :
x = +4 r : x2 =
16
Which of the following are true ?
a) p ⇒r; b) r ⇒p; c) q ⇒r; d) r ⇒q; e) p ⇔r;
f) q ⇔r; g) (p ∨ q) ⇒r; h) r ⇒(p ∨ q); i) (p ∨ q) ⇔r;
C 4.4. Decide which of the sentences below, are universally true, which are
universally false, and which are neither. Write the predicates in symbolic form.
i) (x + 3)2 > 8,
x ∈ N ii) 2x =
9, x ∈ N.

C 4.5. Find the d.n.f. of the following

formulas: i) ¬(¬p ∧ q) ii) ¬(¬p ∨ q) iii)
p ∧ (q ∨ r);

C 4.6. Use quantifiers to express formally the following

propositions: a. There is a natural number whose square is
greater than 7
b. Whatever real number x is, x2 = −(x2 + 1) is false.

C 4.7. Decide, by constructing truth tables, whether the following sets of

statements are logically equivalent
(i) (a ∧ b) ∨ b and a ∧ b
(ii) (a ∧ b) ∨ a and a
(iii) (¬a ∧ b ∧ c) ∨ ((a ∧ b) ∨ c) and b ∧ c (iv) a ⇒b and ¬b ⇒¬a.
C 4.8. Below, y is a variable of data type Nat, c is of data type Char and s and t
are of data type Str. Represent each of the following conditions formally, using
only standard functions of the data types Nat, Char, Str and ∧ , ∨ , ¬, ⇒, ⇔.
i) y is either less than three, or greater than six but less than 10. However y is
not seven.
ii) The first character of s is ‘b‘ and the second character of s is ‘a‘. iii) If s starts
with ‘c‘ then t starts with ‘c‘. iv) s starts with the same character as t, but their
second characters are not the same.
v) c is an upper case vowel, and the first two characters of t are the same if and
only if the first two characters of s are the same. vi) s is the string ”fred” or y has
the value 16, but not both.

4.3 Supplementary problems

S 4.1.√ Decide whether each of the following propositions is true or false:

23
i) 27 ≥ 5; √

ii) 32 + 23 < 250; iii) 34 < 43.

S 4.2 Repeat question C 4.4. for x ∈ R.

S 4.3 Decide whether each of the following predicates is true or

false. i) ∀x ∈ R[x2 >R 0]; ii) ∃ t ∈ N[t2 =N 7]; iii) ∃ s ∈ N[s2 =N 9].

S 4.4 Decide which of the sentences below are universally true in R, which are
universally false and which are neither.
i) (x + 3)2 > 6; ii) x = x + 1; iii)2x = 7; iv) (x − 1)2 = x2 − 2x + 1.

S 4.5 Let R be the proposition ”Roses are red” and B be the proposition ”Violets
are blue”. Express each of the following propositions as logical expressions: a) If
roses are not red, then violets are not blue;
b) Roses are red or violets are not blue;
c) Either roses are red or violets are blue (but not both);
Use a truth table to show that (a) and (b) are equivalent.

S 4.6 Find the d.n.f. of the following formulas and the regions in the Venn
diagram: (i) ¬p ∧ (q ⇒p)
(ii) ¬p ∧ (¬q ∨ r);
(iii) ¬p ∧ (q ∨ r);
4.4 Answers for Tutorial 4
Compulsory problems

C 4.1. John is either not six feet tall, or he weighs less than 200 pounds.

C 4.2. In each case, one needs to build the table for 2 and 3 variables.
For simplicity, the final expressions are called H or G (to avoid too wide tables).
(i) Let H= ¬(¬p∧ q). The corresponding truth table is
p ¬p q ¬p ∧ q H
1 0 1 0 1
1 0 0 0 1
0 1 1 1 0
0 1 0 0 1
(ii) Let H=(p∨¬q)∧ r. The corresponding truth table is
p q r ¬q p∨¬q H
1 1 1 0 1 1
1 1 0 0 1 0
1 0 1 1 1 1
1 0 0 1 1 0
24
 0 1 1 0 0 0
0 1 0 0 0 0
0 0 1 1 1 1
0 0 0 1 1 0
(iii) Let G=(p∧ q)∨ r and H=(p∨ r)∧ (q∨ r). The combined truth table for G and H is
p q r p∧ q p∨ r q∨ r G H
1 1 1 1 1 1 1 1
1 1 0 1 1 1 1 1
1 0 1 0 1 1 1 1
1 0 0 0 1 0 0 0
0 1 1 0 1 1 1 1
0 1 0 0 0 1 0 0
0 0 1 0 1 1 1 1
0 0 0 0 0 0 0 0
hence the two statements are logically equivalent.
(iv)Let G=(p∨ q)∧¬r and H=(p∧¬r)∨ (q∧¬r).
The combined truth table for G and H is
p q r ¬r p∨ q p∧¬r q∧¬r G H
1 1 1 0 1 0 0 0 0
1 1 0 1 1 1 1 1 1
1 0 1 0 1 0 0 0 0
1 0 0 1 1 1 0 1 1
0 1 1 0 1 0 0 0 0
0 1 0 1 1 0 1 1 1
0 0 1 0 0 0 0 0 0
0 0 0 1 0 0 0 0 0
hence the two statements are logically equivalent.

C 4.3. a) T; b) F; c) T; d) F; e) F; f) F; g) T; h) T; i) T;

C 4.4. (i) UT; (ii) UF.

C 4.5. We first find the truth table for each expression.

Note: The truth tables for (i) and (ii) were solved together to save time and
space.
Let G= ¬(¬p ∧ q) and H= ¬(¬p ∨ q). The combined truth table for G and H is
p ¬p q ¬q ¬p ∧ q ¬p ∨ q G H
1 0 1 0 0 1 1 0
1 0 0 1 0 0 1 1
0 1 1 0 1 1 0 0
0 1 0 1 0 1 1 0

25
One obtains (the 3 variables method is covered in the theoretical
background) i) (p ∧ q) ∨ (p ∧ ¬q) ∨ (¬p ∧ ¬q);
ii) p ∧ ¬q; iii) (p ∧ q ∧ r) ∨ (p ∧
¬q ∧ r) ∨ (p ∧ q ∧ ¬r);

C 4.6. i) ∃ x ∈ N s.t. x2 > 7; ii) ∀x ∈ R, x2 6= −(x2 + 1).

C 4.7. (i) yes; (ii) yes; (iii) no; (iv) yes.

C 4.8. (i) ((y < 3) ∨ ((y < 10) ∧ (y > 6))) ∧ ¬(y = 6);
(ii) FIRST(s) = ‘b‘ ∧ FIRST(FIRST(s)) = ‘a‘;
(iii) (FIRST(s) = ‘c‘) ⇒FIRST(t) = ‘c‘;
(iv) FIRST(s) = FIRST(t)∧ 6= (FIRST(FIRST(s)) = FIRST(FIRST(t));

ASC(c) ≤ 90 ∧ FIRST(t) = FIRST(FIRST FIRST(s) =

FIRST(FIRST(s));
(vi) (s = ”fred” ∨ y = 16) ∧ ¬(s = ”fred” ∧ y = 16).
Supplementary problems S

4.1. (i) T; (ii) F; (iii) F.

S 4.2. (i) UT; (ii) neither.

S 4.3. (i) F; (ii) F; (iii) T.

S 4.4. i) UT; ii) UF; iii) neither; iv) UT.

S 4.5. a) ¬R⇒¬B; b) R∨¬B; c) (R∨ B)∧¬(R∧ B)

S 4.6. One needs to construct the truth table for each expression, then write the
brackets corresponding to the 1 (or T) values and finally connect them using ∨
(disjunction).

26
5 C.n.f, negation of quantifiers, proof and argument
5.1 Brief theoretical background
In general, one may use the set {0, 1} instead of the boolean values B = {True,
False}.

Disjunctive normal form

Disjunctive normal form (d.n.f.) combines the basic literals, first using ∧ , then
using ∨ .

Exercise. Find the d.n.f of ¬(¬p ∧ q).

Step 1: Truth table

p ¬p q ¬q
¬p ∧ q ¬(¬p∧ q)
1 0 1 0 0 1
1 0 0 1 0 1
0 1 1 0 1 0
0 1 0 1 0 1

Step 2: Identify 1 entries in the last column

Step 3: For each 1 such entry , choose the 1 entries in the first 4 columns their ∧
is 1.

Solution: d.n.f(¬(¬p ∧ q)) = (p ∧ q) ∨ (p ∧ ¬q) ∨ (¬p ∧ ¬q)

Useful formulas for logical operations

• De Morgan‘s Laws

¬(p ∧ q) = ¬p ∨ ¬q
¬(p ∨ q) = ¬p ∧ ¬q

• Distributive Law

p ∧ (q ∨ r) = (p
∧ q) ∨ (p ∧ r) p ∨
(q ∧ r) = (p ∨ q) ∧
(p ∨ r)

• Associative Law

27
 p ∧ (q ∧ r) = (p
∧ q) ∧ (p ∧ r) p ∨
(q ∨ r) = (p ∨ q) ∨
(p ∨ r)
Conjunctive normal form (c.n.f)

Conjunctive normal form (c.n.f.) combines the basic literals, first using ∨ , then using ∧ .

Algorithm for finding the c.n.f of a formula H:

Step 1: Find the d.n.f of ¬H

Step 2: Find the negation of this d.n.f (basically ¬(¬ H))
Observation: Applying ¬ has the following effect: • p
becomes ¬p (and of course, ¬p becomes p)

• ∧ becomes ∨

• ∨ becomes ∧

Negation of quantifiers

• ∀ becomes ∃

• ∃ becomes ∀
p⇒q
p q ¬q ¬p
1 1 1 0 0
1 0 0 1 0
0 1 1 0 1
0 0 1 0 1

Deduction rules
Arguments

28
5.2 Compulsory questions
C 5.1. Find the d.n.f and c.n.f of the following statements
(i) p ∨ (q ∧ r);
(ii) ¬((p ∧ q) ∨ r);
(iii) p ⇔(q ∧ r);

C 5.2. Given the following truth table for a formula H, find the disjunctive normal
form for H and hence find the conjunctive normal form of H.
p q H

1 1 1
1 0 0
0 1 0
0 0 1

C 5.3. Given the following truth table for a formula G, find the d.n.f for G and
hence find the c.n.f of G. Also identify the corresponding regions in the Venn
diagram.

p q r G
1 1 1 0
1 1 0 1
1 0 1 0
1 0 0 0
0 1 1 0
0 1 0 1
0 0 1 1
0 0 0 1
C 5.4. Write the English statements that are the negations of each of the
sentences
(i) All dogs bark;
(ii) Some birds fly;
(iii) No cat likes to swim;
(iv) No computer science student does not know mathematics.

C 5.5. Find the negation of the following statements and evaluate their truth
values:
(i) ∀ x ∈ R [ x2 − 6x + 10 ≥ 0]; (ii) ∀ x ∈ R [ x2 ≥
x]; (iii) ∃ x ∈ N+ [ x2 + 2x − 2 ≤ 0]; (iv) ∃ x ∈
Q [ x = 3].
2

C 5.6. Prove Modus Ponens, Modus Tollens, Inverse Error and Converse Error
using the truth table from the previous page.
29
5.3 Supplementary questions
S 5.1. Find the d.n.f and c.n.f of the following
expressions: (i) ¬(p⇒q); (ii) p⇒(q∧ r); (iii) ¬(p⇔q).

S 5.2. Find the c.n.f of

(i) ¬(p ⇒¬q)
(ii) ¬p ∧ (q ⇒p)
(iii) ¬((p ∧ q) ∨ r)
(iv) ¬((p ∨ q) ∧ r)
(v) ((p ∨ q) ∧ ¬r)
S 5.3. Interpret the following quantified propositions in English and state which
are true and which are false:
(i) ∀ s ∈ S [ ( ¬(s = ””)) ⇔(LEN(s) ≥ 1 )];
(ii) ∀ s ∈ S [ ∃ c ∈ C [ c = FIRST(s)] ];
(iii) ∀ s ∈ S [ ∃ c ∈ C [ (s = ”” ) ∨ c = FIRST(s)) ] ].

S 5.4. Use Deduction Rules to prove which of the following arguments are valid
and which are fallacious, you may only use a deduction rule that you have
already proved via truth tables. No credit will be given for decisions that are not
justified.

(i) If the apple is ripe, then it will be sweet; The apple is sweet.
Therefore the apple is ripe.
(ii) If I go to the pub, I won‘t finish my revision;
If I don‘t finish my revision, I won‘t do well in the exam tomorrow.
Thus if I go to the pub, I won‘t do well in the exam tomorrow.
(iii) Gill is playing rugby if Tom is not in class;
If Gill is not playing rugby then Tom will be in class
Therefore Tom is not in class or Gill is not playing rugby.
(iv) Sam is studying maths or Sam is studying economics; Sam is
required to take logic if he is studying maths.
So Sam is an economics student or he is not required to take logic.
(v) English men wear bowler hats;
The man is wearing a bowler hat.
Therefore he must be English.
S 5.5. Comment on the following argument.
Storing on floppy disk is better than nothing. Nothing is better than a hard disk
drive.
Therefore, storing on floppy disk is better than a hard disk drive.

30
5.4 Answers for Tutorial 5
Compulsory problems

C 5.1. We first need to find the truth table for the expressions
A= p ∨ (q ∧ r), B= ¬((p ∧ q) ∨ r) and C= p ⇔(q ∧ r) and their negations.
p q r q∧ r p∧ q (p∧ q)∨ r A B C ¬A ¬B ¬C
1 1 1 1 1 1 1 0 1 0 1 0
1 1 0 0 1 1 1 0 0 0 1 1
1 0 1 0 0 1 1 0 0 0 1 1
1 0 0 0 0 0 1 1 0 0 0 1
0 1 1 1 0 1 1 0 0 0 1 1
0 1 0 0 0 0 0 1 1 1 0 0
0 0 1 0 0 1 0 0 1 1 1 0
0 0 0 0 0 0 0 1 1 1 0 0
(i) Using the columns corresponding to A and ¬A we obtain
d.n.f(A)= (p ∧ q ∧ r) ∨ (p ∧ q ∧ ¬r) ∨ (p ∧ ¬q ∧ r) ∨ (p ∧ ¬q ∧ ¬r) ∨ (¬p ∧ q ∧ r).
c.n.f(A)= ¬d.n.f(¬A)= (p ∨ ¬q ∨ r) ∧ (p ∨ q ∨ ¬r) ∧ (p ∨
q ∨ r). (ii) Using the columns corresponding to B and ¬B
we obtain d.n.f(B) = (p ∧ ¬q ∧ ¬r) ∨ (¬p ∧ q ∧ ¬r) ∨
(¬p ∧ ¬q ∧ ¬r).
c.n.f(B)= (¬p∨¬q∨¬r)∧(¬p∨¬q∨ r)∧(¬p∨ q∨¬r)∧(p∨¬q∨¬r)∧(p∨ q∨¬r).
(iii) Using the columns corresponding to C and ¬C we obtain
d.n.f(C) = (p ∧ q ∧ r) ∨ (¬p ∧ q ∧ ¬r) ∨ (¬p ∧ ¬q ∧ r) ∨ (¬p ∧ ¬q ∧ ¬r).
c.n.f(C)= ¬d.n.f(¬C)= (¬p ∨ ¬q ∨ ¬r) ∧ (¬p ∨ q ∨ ¬r) ∧ (¬p ∨ q ∨ r) ∧ (p ∨ ¬q ∨ ¬r).

C 5.2. As seen above, we add the column corresponding to ¬H and obtain

d.n.f(H)= (p ∧ q) ∨ (¬p ∧ ¬q); c.n.f(H)= ¬d.n.f(¬H)= (¬p ∨ q) ∧ (p ∨ ¬q).

C 5.3. As seen above, we add the column corresponding to ¬G and obtain

d.n.f(G) = (p ∧ q ∧ ¬r) ∨ (¬p ∧ q ∧ ¬r) ∨ (¬p ∧ ¬q ∧ r) ∨ (¬p ∧ ¬q ∧ ¬r).
c.n.f(G)= ¬d.n.f(¬G)= (¬p ∨ ¬q ∨ r) ∧ (¬p ∨ q ∨ ¬r) ∧ (¬p ∨ q ∨ r) ∧ (p ∨ ¬q ∨ ¬r).

C 5.4. (i) There is at least one dog which can’t bark;

(ii) There is at least one bird which can’t fly;
(iii) There is at least one cat which likes to swim;
(i) There is at least one computer science student who knows mathematics.

C 5.5. (i) ∃ x ∈ R [ x2 − 6x + 10 < 0] F; (ii) ∃ x ∈ R [ x2 < x] T; (iii) ∀ x

∈ N+ [ x2 + 2x − 2 > 0] T; (iv) ∀ x ∈ Q [ x2 6= 3] T.

C 5.6. The detailed proof is available in the lecture slides (Lecture 5).

31
6 Vectors and complex numbers
6.1 Brief theoretical background
Vector: A quantity having direction as well as magnitude.

Notations: A vector is an ordered collection of n elements (components).

−
→
a ,, a, aˆ
a = (a1, a2, a3), a = (ax, ay, az), a = [ax, ay, az]

a (column)
−→
A(a1, a2, a3), B(b1, b2, b3) ⇒AB = (b1 − a1, b2 − a2, b3 − a3).

Properties and operations:

• Equality: Two vectors are equal if they have the same modulus and
direction.
• Addition:
−→ −→ −→
– AB + BC = AC (triangle rule for geometric vectors)
– Let a = (a1, a2, a3) and b = (b1, b2, b3) be two vectors. Their sum is

a + b = (a1 + b1, a2 + b2, a3 + b3).

• Multiplication by a scalar: Let a = (a1, a2, a3) be a vector and λ ∈ R. Then

λa = λ(a1, a2, a3) = (λa1, λa2, λa3).

• Substraction: a − b = a + (−1)b.
Special vectors:
• zero vector: 0 = (0, 0, 0) ∈ R3 (3D) or 0 = (0, 0) ∈ R2 (2D)

• Unit vectors: kak = 1. Sometimes denoted by aˆ.

Centre of mass: The system of points A1, . . . , An has the centre of mass M s.t.
−−→ −−→ −−→
−−→ OA1 +OA2 + ··· +OAn
OM = .
n

32
Centre of mass (with weights): The system of points A1, . . . , An with masses m1,
. . . , mn has the centre of mass M s.t.
−−→ −−→ −−→
−−→ m1OA1 + m2OA2 + ··· + mnOAn
OM = .
m1 + m2 + ··· + mn
Polygon addition rule: Let A, B, C, D be points in plane (space). Then
(same is true for a polygon A1, . . . , An)
Dot (scalar) product: Let a = (a1, a2, a3) and b = (b1, b2, b3) be two vectors.

a · b = a1 · b1 + a2 · b2 + a3 · b3

= kakkbk cos θ
Applications of the scalar product:

• The modulus of vector a = (a1, a2, a3) is obtained from the formula

• The angle θ between vectors a and b is

a·b
cos θ =
kakkbk

• Vectors a and b are perpendicular if and only if

θ = π/2 ⇔cos θ = 0 ⇔a · b = 0

• Unit vectors for a (same direction, modulus one):

a = kakaˆ

Cross product (Vector product) Let a = (a1, a2, a3) and b = (b1, b2, b3) be two
vectors. The cross (vector) product is equal to

a × b = kakkbk sin θ nˆ.

Standard base: i = (1, 0, 0); j = (0, 1, 0); k = (0, 0, 1).
The vector product for the standard base:

i × j = k; j
× i = −k j × k =
i; k×j=
−i k × i = j; i

33
 × k = −j i × i = j
×j=k×k=0

Vector product in coordinate notation: For vectors

a = (a1, a2, a3) = a1i +

a2j + a3k. b = (b1, b2, b3)
= b1i + b2j + b3k.

the vector product is defined as

a × b = (a1i + a2j + a3k) × (b1i + b2j + b3k)

= (a2b3 − a3b2)i−(a1b3 − a3b1)j + (a1b2 − a2b1)k
Applications of the cross (vector) product:

• The area of a triangle between vectors a = (a1, a2, a3) and b = (b1, b2, b3) is
obtained from the formula

S = k a × bk

• The angle θ between vectors a and b is

• Vectors a and b are parallel if and only if

θ = 0 ⇔sin θ = 0 ⇔a × b = 0

• Find a vector perpendicular to a plane. Take points A, B, C ∈ R3:

−→ −→ −→
AB × AC ⊥ AB
−→ −→ −→
AB × AC ⊥ AC
√
Complex numbers: The imaginary number: i = −1 solves the equation x2 + 1 = 0.
Notation:

z = a + bi, a, b ∈ R

a = <(z) = r cos θ (real

part) b = =(z) = r sin θ,
(imaginary part)

34
 r = |z| = pa2 + b2,

(modulus) θ ∈ [0, 2π)

(argument)

The complex conjugate The conjugate of z = a + bi is the number z = a − bi.

z1/z2 = z1/z2

Modulus property:

|z|2 = zz = (a + bi)(a − bi) = a2 + b2.

Basic operations with complex numbers: Let z1 = a + bi and z2 = c + di.

The following operations are defined:

• Addition:

z1 + z2 = (a + bi) + (c + di) = (a + c) + (b + d)i

• Substraction:

z1 − z2 = (a + bi) − (c + di) = (a − c) + (b − d)i

• Multiplication (remember that i2 = −1)

z1z2 = (a + bi)(c + di)

= ac + adi + bci + bdi2
= (ac − bd) + (ad + bc)i
35
 • Division (remember that i2 = −1 and zz = |z|2)

z1 a + bi (a + bi)(c − di)
= =
z2 c + di (c +
di)(c − di) ac +
bd bc − ad
= 2 + d2 +
c2 + d2 i
c
6.2 Compulsory questions
C 6.1. Decide which of the following are vector quantities: Velocity, mass,
acceleration, weight, area, temperature, force, potential energy, volume.

C 6.2. In a system of vectors , a force of 10 newtons is represented by a line 5cm

long. Find the magnitude of the force vector represented in the system by a line
2cm long.

C 6.3. i) Find the magnitude of the following vectors: a = −2i + 3j + 4k; b

= i + 2j − 4k; c = 3i − 2j + k; d = 2j + 3k.
ii) Find unit vectors parallel to the following vectors
u = i − 2j + 4k; v = 0.5i + 2j − k; w = i − 2j;
iii) Find x ∈ R such that the vector c = (x, 1, 1) is perpendicular on u, v and w.

C 6.4. i) Evaluate the dot products of the following pairs of vectors:

a) p = 2i − 3j + k, q = 3i + 4j − 3k
b) m = 2i − 3j + 5k, l = 3i + 2j − 2k
c) v = i + 2j + 2k, u = −2i − j + 2k
ii) Use the definition of the dot product and your answers to part i) to determine
the angles between the pairs of vectors in part i). iii) For each pair of vectors in i),

find a vector that is perpendicular on both vectors.

C 6.5. Evaluate the cross products of the following vectors:

a) p = 2i − j + k, q = 3i + 4j − k
b) a = i + 2j − 3k, b = −2i + 4j + k
c) r = i + 2j − 3k, s = 2i + j + 3k.
C 6.6. Let z1 = 2 + 3i and z2 = 3 − 4i. Compute the following

(1) z1 + z2;

36
 (2) z1 − z2;
(3) z1z2;
(4) |z1|;
(5) z1/z2;
(6) z1 − z2;
(7) z1z2;
(8) z2z2;
;
;
6.3 Supplementary questions
S 6.1. Let ABCD be a quadrilateral. Find each of the single vectors equivalent to
−→ −→
(i) AB + BC ;
−→ −→ −→
(ii) AB + BC + CD;
−→ −→
(iii) AD + DC;
−→ −→
(iv) BC + CD;
−→ −→
(v) AB + DA;
−→ −→ −→
S 6.2. O, A, B, C, D are five points such that OA = a, AB = b , AB = a + 2b and
−→ −→−→−→−→ −→
OD = 2a − b. Express AB, BC, CD, AC and BD in terms of a and b.
S 6.3. Let ABCD be a quadrilateral, whose vertices have coordinates A(1,1),
B(7,3),
C(10,12), D(8,2). Find the vectors
−→ −→ −→ −→
(i) AB; (ii) AC; (iii) AD; (iv) BD;
−→ −→
S 6.4. For the quadrilateral ABCD in S 6.3. , check whether the diagonals AC and
BD are perpendicular. If not, what is the angle between them ?

S 6.5. Let ABCD be a quadrilateral, whose vertices are A(1,1), B(7,3), C(10,12),
D(8,2).
(i) Find the centre of mass G for the quadrilateral ABCD.
(ii) Find the centres of mass G1, G2, G3, G4 corresponding to each of the triangles
ABC, BCD, CDA, DAB.

37
(iii) Find the centre of mass G0 for the quadrilateral G1G2G3G4. What is the
relation between G0 and G?

S 6.6. Answer the same questions as in problem

S 6.5. , when the masses 1kg, 2kg, 3kg and 4kg are attached to A, B, C and D,
respectively.

S 6.7. Compute the following expressions:

(i) 1 3 4
(ii) 1+−

S 6.8. Solve in C the following equations:

(i) z2 + 4z
+ 2 = 0; (ii)
z2 + 4z + 4
= 0;
(iii) z2 + 4z + 5 = 0.
(iv) ix2 + (1 − 4i)x + 4i − 1 = 0.

S 6.9. Let z = 2 + 3i. Find the complex number u = a + bi s.t. u2 = z.

S 6.10. Given that z is not real and |z| = 1, prove that the number w is a
pure imaginary number.
6.4 Answers for Tutorial 6
Compulsory problems

C 6.1. Vectors: velocity, acceleration, force.

C 6.2. 4 newtons.
√ √ √ √
C 6.3. (i) kak = 29; k bk = 21; k ck = 18; k dk = 13;

(ii) uˆ

; vˆ ; wˆ = √1 (i − 2j);
5

(iii) c ⊥ u: x=-2; c ⊥ v: x=-2; c ⊥ w: x=2.

C 6.4. (i) a) p · q = −9; b) m · l = −10; c) v · u = 0.

38
 (iii) In each case we have to find a vector a = (x, y, z) s.t.
a) a · p = a · q = 0. Solution: a = (t, 9/5t, 17/10t), t ∈ R.
b) a · m = a · l = 0. Solution: a = (t, −7/2t, −16/13t), t ∈ R.
c) a · v = a · u = 0. Solution: a = (t, −t, 1/2t), t ∈ R.

C 6.5. a) p × q = −3i + 5j + 11k; b) a × b = 14i + 5j + 8k; c) r × s = 9i − 9j − 3k.

√
C 6.6. (1) 5 − i; (2) −1 + 7i; (3) 18 + i; (4) 13; (5) (−6 + 17i)/25; (6) −1 − i; (7) −6 +
17i; (8) 25; (9) −46 + 9i; (10) 119 − 12i.

Supplementary problems

;
7 Matrices
7.1 Brief theoretical background
Matrix: array of numbers called elements. Horizontal components are called
rows (or lines) while the vertical components are called columns. A matrix with
m rows and n columns is of dimension (size, order) m × n.

Example: The following matrix has 2 rows and 4 columns

Serious Definition: A matrix of order m × n in X is a function

A : {1, . . . , m} × {1, . . . , n} →X, A(i, j) = aij.
Special times of matrices (orderwise):
• row matrix

• column matrix

or

39
 • square matrix - same number of rows as columns (i.e. m=n)

Matrix notation
• Matrices are usually denoted by capital letters.
A

• a matrix of order m × n is denoted by

A= ai1 ··· aij ··· ain

. . . . .

• aij denotes the element in row i and column j.

Special matrices

• The zero matrix: all its elements are zero. The zero 2 × 2 matrix is

• Diagonal matrix: Square, elements outside the main diagonal are zero.

A , B

• The identity matrix: Diagonal matrix with 1 on the main diagonal.

I , I

Equality of matrices Two matrices are equal if they have

• same dimension

• equal corresponding elements

Matrix operations

• Transpose of a matrix: The transpose of a matrix changes columns with

rows.
First column becomes the first row, second column becomes the second row, etc.
40
 If A , then AT

Remark: The transpose of an m × n matrix is an n × m matrix.

• Addition and substraction:

– element by element operation

– matrices need to be of the same order (dimension, size)
– addition and substraction are done element by element

• Multiplication by a scalar:
Let A be a matrix and λ ∈ R a scalar (number).
The matrix λA is obtained by multiplying each element of A by λ.

λA
• Multiplication of two matrices: the rule of row-column multiplication. Let
A, B be matrices of sizes m × n and n × p respectively.
The element cij in C = AB is obtained by multiplying

– the i-th row of A by

– the j-th column of B

• determinant of 2 × 2 matrix

• inverse of 2 × 2 matrix

Let A be a matrix. The inverse matrix is

41
Solution of a linear system of equations
Consider the system of linear equations

2x + 3y = 13
3x + 4y = 18

This can be written in matrix form as

The solution is

7.2 Compulsory questions

C 7.1. State the dimension of each of the following matrices:

(a) A B C D .
C 7.2. Indicate whether the following statements are true or false, for

(a) A B ,

(c ) C D E .
(i) D = A; (ii) D = E; (iii) B = C; (iv) A = B; (v) D − C = 0.

C 7.3. Let A, B and C be the matrices defined below

A , B , C ,
Compute each of the following
(i) A + C; (ii) A − B; (iii) 2A; (iv) -3C; (v) A − 2B + 4C; (vi) BT; (vii) B + CT.

C 7.4. Form the product of the following matrices, stating whether the result is a
column or row vector:

C 7.5. Find the determinant of the matrix , and find its

inverse. Use the result to solve the pair of simultaneous equations

42
 5x + 3y = 19
4x + 2y = 14
C 7.6.

Let A , B , C ,
Compute (i) AB; (ii) AC; (iii) CA.
Show that AC 6= CA, therefore the matrix multiplication is generally not true.
7.3 Supplementary questions
S 7.1. Compute (i) A + B; (ii) AT + BT; (iii) (A + B)T for the matrices below.

Let A , and B
What is the connection between the results for parts (i) and (ii) above?

S 7.2. Compute (i) C + D; (ii) C − D; (iii) C + CT; (iv) (C − D)T; (v) (CT)T for

C , and D
S 7.3. Compute AI and IA for the matrices

A , and I
What does this suggest about the multiplication by the identity matrix ?

S 7.4. Find (i) AT; (ii) AAT and (iii) ATA for the matrix A .
S 7.5. Given the following matrices

A , B , C , D ,
State the size of the following products and compute the ones that exist.
(i) AB; (ii) BA; (iii) CD; (iv) DC; (v) DB; (vi) BD; (vii) A2. (viii) C2.

S 7.6. Evaluate the determinants of the following matrices:

A , B , C , D , E .
Find the inverses of the 2× 2 matrices B, C and D.

43
S 7.7. Solve the following systems of linear equations using the inverse matrix
method.
3x − y = 4; 2x − y = −11; 4x − 3y = 6; 3x − 4y = −9 x + 2y
= 13; x + 2y = 2; −2x + y = −4; x + 2y = 2
S 7.8. State the reason why the inverse matrix method may not be applied to the
system of equations 4x + 6y = 12; 1 + 3y = 14.

7.4 Answers for Tutorial 7

Compulsory problems

C 7.1. (a) 2 × 3; (b) 3 × 2; (c) 1 × 2; (d) 3 × 1.

C 7.2. (a) F; (b) F; (c) T; (d) F; (e) F.

; ( v) ; (vi) BT ;
(vii) operation not defined.

C 7.4. (i) row matrix: ; (ii) row matrix: ;

(iii) column matrix: ; (iv) square matrix: ;

C 7.5. det A = −2; A ; x = 2; y = 3.

C 7.6. (i) AB ; (ii) AC CA .

Supplementary problems

S 7.1.
S 7.2.
S 7.3.
S 7.4.
S 7.5.
S 7.6.
S 7.7.
S 7.8.

44
8 Computer graphics in 2D: Matrix transformations
8.1 Brief theoretical background
Matrix representation: Matrices are useful for

representing • Points: represented by a column

matrix (position vector)

X .

• Lines: defined by two points and represented by a 2 × 2 matrix.

The matrix represents a line through points and .

• Polygons: Represented by a 2 × n matrix.

The matrix represents the triangle and .

Matrix transformations: Consider the point X and a transformation matrix T
given by

X , T .

Matrix T pre-multiplies point X, generating another point X∗

TX X∗

Example: The point X is transformed by the matrix T .

X∗ TX

Transformation of lines:

• Take two points X, Y and a transformation T

• Apply the transformation T to both X, Y (they determine a line XY)

• The transformed points X∗ , Y∗ determine a new line X∗ Y∗

Remark: Linear transformations change lines into lines.

8.2 Linear transformations in 2D
Consider the point X, vector V and a transformation matrix T given by
45
 X , V , T .
The following linear transformations can be defined.

Translation: The translation of point X by vector V is defined by

X .
Scaling: Scales the horizontal and vertical coordinates. The transformation
matrix is

T ; X TX .
Rotation: The line from (0,0) to the point (x, y), is rotated by an angle θ.

By convention anticlockwise movement is considered positive.

We say that (x, y) has rotated about the origin to (x∗ , y∗ ). The transformation
matrix is:

T .
Reflections:
• in the X axis: changes the sign of the y co-ordinate

T ; X∗ = TX

• in the Y axis: changes the sign of the x co-ordinate

T ; X∗ = TX

• in the y = x line: interchanges the x and y co-ordinates.

T ; X∗ = TX

• in the y = −x line: interchanges x and y co-ordinates and changes their signs.

T ; X∗ = TX
Shearing (optional): A shear is a distortion. The transformation matrix

46
The ’off-diagonal’ elements b and c determine the kind of shear produced.
• b produces x-direction shear, • c produces y-direction shear.

Combination of transformations: If the point X is subject to two transformations

T1 and T2, then it is subject to the composed transformation T = T2T1.

X∗ = T2(T1X) = (T2T1)X = TX.

8.3 Compulsory questions

C 8.1. A straight line joins the points (3, 2) and (4, 5). Describe the transformed

line produced by the matrix T .

C 8.2. Write down a transformation matrix which
a) scales vertical lines by a factor of 3 and leaves horizontal lines unchanged.
b) scales horizontal lines by a factor of 2 and vertical lines by a factor of 5.

C 8.3. The point (3,1) is rotated anticlockwise about the origin through an angle
of 45◦ . Calculate the position of the new point.

C 8.4. Write down the following matrices.

a) Rotation about the origin, anti- clockwise through π/6 radians.
b) Rotation about the origin, clockwise through π/6.
c) Use the appropriate matrix to find the new position of the point (2, 3) after it
has been rotated anti-clockwise through π/6 about the origin.
d) Calculate the product of the two matrices found in (a) and (b). Explain your
answer.

C 8.5. Consider the 2D unit square having coordinates (0,0), (0,1), (1,0), (1,1).
Determine the new co-ordinates of the figure after the following
transformations:
(1) Translation of vector (1,2); (2) horizontal scaling of factor 2;
(3) vertical scaling of factor 3; (4) mixed scaling of factors 3 and 4;
(5) Rotation of angle π/6; (6) Rotation of angle 90◦ ; (7) Reflection in the X axis;
(8) Reflection in the Y axis; (9) Reflection in the y = x line;
(10) Reflection in the y = −x line.

C 8.6. Point (2,3) is reflected in Y axis, then reflected in y = x, and finally rotated
by 90◦ . Find the co-ordinates of the final point.

8.4 Supplementary questions

S 8.1. Show that for any transformation matrix R, which represents a rotation,
that RT = R−1. (i.e. the transpose of a rotation matrix is equal to its inverse).

47
S 8.2. Let R be the rotation matrix about the origin through angle θ.
a) State the rotation matrix S representing a clockwise rotation through an angle
θ.
b) Calculate R−1 using the result of Question S 8.1. above.
c) What can be concluded from parts (a) and (b) above.

S 8.3. Write down transformation matrices which will:

a) scale vertical lines by a factor of 5 and leave horizontal lines unchanged.
b) scale horizontal lines by a factor of 4 and vertical lines by a factor 0.25.
c) Use the above matrices to find the new co-ordinates of the points (2,1) and (-
2,-1),performing each transformation separately.

S 8.4. Point A(2,-1) is reflected in X axis, then rotated by 90◦ and finally reflected
in y = −x. Find the co-ordinates of the final point.

S 8.5. Find the coordinates of the unit square defined in C 8.6., subject to the
shear transformations given by the matrices:

48
8.5 Answers for Tutorial 8
Compulsory problems

C 8.1. The first line is . The transformed line is

C 8.2. a) T ; b) T .

C 8.3. The new point is given by: T .

C 8.4. Using the formulas for the rotation matrix we obtain
√
(a) R = cos π/6 − sin π/6
3/2 √−1/2 .
sin π/6 cos π/6 1/2 3/2
(b) S

.
2 cos π/6
(c) R.
3 sin π/6 cos
(d) The product is the identity matrix, as the two transformations cancel each other.

C 8.5. First, the unit square is represented by the matrix .

49
 /6
(5)
sin π/6 cos

C 8.6. The following matrix transformations are involved

T , T , T
The final transformation is

T
The co-ordinates of the transformed point are (−3, −2).

Supplementary problems
S 8.1. The transformation matrix for a rotation of angle θ is

R , whose inverse is the rotation of angle −θ, which

satisfies

R T,

because sin(−θ) = − sin(θ) and cos(−θ) = cos(θ).

S 8.2. The answer can easily be obtained from S 8.3. and C 8.4.

S 8.3. a) T ; b) T . (c) (10, 1), (-10, -1); (1/2,8), (-1/2, -8).

S 8.4. The following matrix transformations are involved

T , T , T
50
The final transformation is

T
The co-ordinates of the transformed point are (−2, 1).

.
9 Elements of graph theory
9.1 Brief theoretical background
Graph: mathematical structure used to model pairwise relations between
objects from a certain collection.

Basic elements of a graph G:

• vertices: (nodes) V(G): the set of points

• edges: (arcs) E(G): lines connecting two vertices (directed or not)

• loops: edge that connects a vertex to itself

• order (degree) of a node: number of ’incident’ edges.

• trail: sequence of arcs, where the end node of one arc is the start of the
next.

• path: trail in which no node is passed through more than once

• cycle: path with an extra arc joining the final node to the initial node.
Example:

Special graphs

• connected: It is possible to reach any node from any node

• complete: Any two vertices are connected by an arc (Notation: K3, K4, etc.)

• planar: It can be drawn so that the arcs do not cross

51
 • simple: A graph with no loops or multiple arcs

• tree: Simple graph with no cycles

• spanning tree (for a connected, undirected graph): subgraph that is a tree

and connects all the vertices together.

• network: A graph with weighted arcs

Adjacency matrix: For a graph G with n vertices this is a n × n matrix such that
• non-diagonal entry aij: number of edges from vertex i to vertex j,

• diagonal entry aii: number of edges from vertex i to itself taken

– once - directed graphs

– twice - undirected graphs
Standard operations on binary trees:
The set of all trees with vertices in set X is denoted by BTREE(X).
For a given tree t ∈ BTREE(X) the following operations are defined

• ROOT: BTREE(X) →X (finds root)

• LEFT: BTREE(X) →BTREE(X) (finds left branch)

• RIGHT: BTREE(X) →BTREE(X) (finds right branch)

• ISEMPTYTREE: BTREE(X) →B (checks if tree is empty)

For t and r trees in BTREE(X) and s ∈ X one can define the function:

• MAKE: BTREE(X) × X × BTREE(X) →BTREE(X)

The output of MAKE(t, s, r) is a tree with left branch t, root s and right branch r.
Network problems
• minimum spanning tree (Kruskal, Prim)

• shortest path (Dijkstra)

Kruskal’s algorithm (minimum spanning tree):
• List the arcs in order of increasing weight

• Choose the arc with least weight

• Build a tree by working down the list choosing arcs provided they do not
form a cycle when added to the arcs already chosen

• Stop when no more arcs can be chosen

Prims’s algorithm (minimum spanning tree):
• Choose a node

52
 • Build a tree by choosing the minimum weight arc that joins a node that has
not yet been chosen to one that has. Add this arc and the node at its end
to the tree

• Repeat the tree building process until all the nodes have been chosen
Shortest path problem: Find the minimal cost path between two vertices in a
graph.
9.2 Compulsory problems
C 9.1. Prove that the sum of the degrees of the vertices of any finite graph is
even.

C 9.2. Draw the graphs represented by the following adjacency matrices:

a b c d e a b c d e a b c d e
a 0 1 1 0 1 a 0 1 0 0 1 a 0 1 0 0 1
b 1 0 1 1 1 b 1 0 1 1 0 b 0 0 0 0 0
c 1 1 0 0 0 c 0 1 1 1 0 c 0 0 0 0 0
d 0 1 0 0 1 d 0 1 1 0 1 d 0 0 0 0 1
(i) e 1 1 0 1 0 ; (ii) e 1 0 0 1 1 ; (iii) e 0 0 0 0 0

C 9.3. a) Write down the information in C 9.2. as a relation R ⊂ X × X where

X = {a, b, c, d, e} i.e. as a set of ordered pairs.

b) Which if any of the graphs in C 9.2. have the following properties:

connected, complete, directed, undirected, contain a cycle, contain a loop, is a
tree, contains a vertex which is even, contains a vertex which is odd? Justify your
answers.

C 9.4. In a group of people John likes Mary, Brian and Emma; Brian likes Mary
and Sue; Mary likes John and Sue; Emma likes Mary, John and Brian; Sue likes
nobody. Draw a graph showing who likes who.

C 9.5. Given the trees p and q from BTREE(BIRDS) defined below

Write down the following: i)

LEFT(RIGHT(p)); ii)
ISEMPTYTREE(RIGHT(RIGHT(q
)));
iii)
ROOT(LEFT(
p)); iv)

53
MAKE(q,
gull, q);
v) MAKE (LEFT(p), ROOT(q), RIGHT(p)); vi)
MAKE(LEFT(LEFT(q)), ROOT(p), MAKE(q, puffin, RIGHT(p))).

C 9.6. Given the tree u from BTREE(S) defined below:

Evaluate each of the following: i)

LEFT(RIGHT(LEFT(u))); ii)
RIGHT(LEFT(RIGHT(u))); iii)
ROOT(u) +S
ROOT(LEFT(RIGHT(u)).

9.3 Supplementary problems

S 9.1. Show that a tree with n vertices has exactly n − 1 edges.

S 9.2. Prove that a complete graph with n vertices (Kn) contains n(n − 1)/2 edges.

S 9.3. Show that every simple graph has two vertices of the same degree.

S 9.4. Use standard functions of Btree(X) to give a formal description in standard

form of a function REPL that inputs a binary tree and an item from X, and
replaces the root of the left subtree by the input item.

S 9.5. Using standard functions of Btree(X), describe the following functions.

i) A function F that inputs a vertex and a binary tree, and replaces the root of the
tree by the input vertex. ii) A function G that inputs a binary tree and exchanges
the left and right subtrees. Give an example in each case to illustrate what the
function does.

S 9.6. Let a network be given by the distance matrix

A B C D E F G

A - 10 5 4 3 - -
B 10 - 8 9 7 - 2
C 5 8 - - 5 - -
D 4 9 - - 10 6 4
E 3 7 5 10 - 8 9
F - - - 6 8 - 11

54
 G - 2 - 4 9 11 -
(a) Find the minimum spanning tree using Prim’s algorithm.
(b) Find the minimum spanning tree using Kruskal’s algorithm.
(c) Find the shortest path between A and G.
9.4 Answers for Tutorial 9
Compulsory problems
C 9.1. Each arc contributes with 2 to the sum of degrees, therefore this sum
should be twice the number of arcs.

C 9.2. You just have to draw the vertices {a, b, c, d, e} and directed segments
from x to y if (x, y) = 1 in the adjacency matrix.

C 9.3. We write down the directed segments corresponding to each matrix

(i) G1 = {(a, b), (a, c), (a, e), (b, a), (b, c), (b, d), (b, e), (c, a), (c, b), (d, b), (d, e), (e, a), (e,
b), (e, d)}; (ii) G2 = {(a, b), (a, e), (b, a), (b, c), (b, d), (c, b), (c, c), (c, d)(d, b), (d, c), (d,
e)(e, a), (e, d), (e, e)}; (iii) G3 = {(a, b), (a, e), (d, e)}.

C 9.4. The adjacency matrix is

John Mary Brian Emma Sue

John 0 1 1 1 0
Mary 1 0 0 0 1
Brian 0 1 0 0 1
Emma 1 1 1 0 0
Sue 0 0 0 0 0
Drawing the graph is straightforward.

C 9.5. i) swan; ii) False; iii) hawk;

iv) Tree whose left branch is q, root is ”gull” and right branch is q;
v) Tree whose left branch is LEFT(p), root is ”rook” and right branch is
RIGHT(p);vi) Tree whose left branch is empty, root is ”eagle” and right branch
is another tree; this smaller tree has left branch q, root ”puffin” and right
branch RIGHT(p).

C 9.6. i) empty; ii) empty; iii) ”adamwitch”.

Supplementary
problems S 9.1.
S 9.2.
S 9.3.
S 9.4.
S 9.5.
S 9.6.

55
10 Elements of number theory and cryptography
10.1 Brief theoretical background
Prime number: n prime if his only positive divisors are 1 and itself.

Fundamental theorem of arithmetic (unique factorization theorem):

Every integer n ≥ 1 is either prime or is the product of prime numbers.
Every integer n > 1 can be represented uniquely as a product of prime powers

n pkak, (canonical representation)

where p1 < p2 < ... < pk are primes and ai are positive integers.

Greatest common divisor: gcd(a, b) or (a, b)

Least common multiple: lcm(a, b) or [a, b]

Definition: Numbers a and b are relatively prime if gcd(a, b) = 1.

Properties of gcd(a,b) and lcm(a,b): If a pkak, b pbkk

where p1 < p2 < ... < pk are primes and ai, bi are non-negative integers.
The following properties hold:

a · b = p1a1+b1 p2a2+b2 ··· pkak+bk

(ak,bk)

lcm(a, b) = p1max(a1,b1) p2max(a2,b2) ···

pmaxk (ak,bk) a · b = lcm(a, b) ·

gcd(a, b)

Euler’s totient function ϕ(n): Number of integers 1 ≤ k ≤ n for which gcd(n, k) =

1. Formula for prime powers: If p is prime, gcd(m, n) = 1 and k > 1 then

ϕ(p) = p − 1

56
 ϕ(pk) = pk−1(p −
1) ϕ(mn) =
ϕ(m)ϕ(n).

Formula (Euler): If the factorisation of n is n pkak then

ϕ(n) = n .

Example:
Modular arithmetic: system of arithmetic for integers (clock arithmetic), where
numbers ”wrap around” upon reaching a certain value called modulus.

Definition: For n ∈ N, two integers a and b are called congruent modulo n:

a≡ b (mod n),

if their difference a − b is an integer multiple of n.

Operations: If a1 ≡ b1 (mod n) and a2 ≡ b2 (mod n), we can define

• Addition: a1 + a2 ≡ b1 + b2 (mod n)

– 2 + 1 (mod 6) ≡ 3 (mod 6)
– 2 + 4 (mod 6) ≡ (2 + 4) (mod 6) = 0 (mod 6)

• Substraction a1 − a2 ≡ b1 − b2 (mod n)

– 2 − 1 (mod 6) ≡ 3 (mod 6)
– 2 − 4 (mod 6) ≡ (2 − 4) (mod 6) = 4 (mod 6)

• Multiplication a1a2 ≡ b1b2 (mod n).

– 2 × 2 (mod 6) ≡ 4 (mod 6)
– 2 × 3 (mod 6) ≡ 6 (mod 6) = 0 (mod 6)
Caesar cypher:
• Alphabet: A = {A, . . . , Z} so n = 26 (or numbers 0..25).

• m and c are single characters

• encrypt key e ∈ {0, . . . , 25}

• encrypt equation: c = f(e, m) = m + e (mod 26)

• decrypt equation: m = g(d, c) = c + d (mod 26) (f = g) • clearly d + e = 0

(mod 26) (both need to be kept secret!)

57
 • Method:

g(d, c) = g(d, f(e, m)) = g(d, m + e (mod 26))

= ((m + e) (mod 26)) + d) (mod 26) = m

• Example: e = 23 and n = 26, d = 3

• look-up table (e = 3):

plaintext : A, B, C, D, . . .
cyphertext : D, E, F, G, . . .
10.2 Compulsory problems
C 10.1. Find 5 pairs of Pythagorean triples a, b, c ∈ N s.t. a2 = b2 + c2.

C 10.2. Factorize the numbers 96, 144, 286, 777 and 1001.

C 10.3. Find gcd(144, 96), gcd(1001, 777) and

gcd(1001, 286). C 10.4. Find lcm(144, 96), lcm(1001,

777) and lcm(1001, 286).

C 10.5. Compute (find results in the set {0, . . . , n − 1} for (mod n)):
5 + 2 (mod 2), 3 × 5 (mod 2)

3 + 7 (mod 5), 3 − 7 (mod 5), 3 × 7 (mod 5).

3 + 7 (mod 11), 3 − 7 (mod 11), 3 × 7 (mod 11).
C 10.6. Find the ϕ(n) function for the numbers n = 11, 21, 24, 36, 49, 81, 100.

C 10.7. Code the message ”I LIKE MATHS” using a Caesar cipher with key e = 10.

10.3 Supplementary problems

S 10.1. Find the largest prime number smaller than 1000.

S 10.2. Goldbach conjecture:

For n even there are a, b primes s.t. n = a + b. Check this results for n ≤ 100.

S 10.3. Find 7 pairs of twin primes.

S 10.4. Find 5 Mersenne primes of the form Mp = 2p − 1.

S 10.5. Factorize the numbers 703, 779, 968, 1002, 1440, 1547, 1763, 2261.

58
S 10.6. Find gcd(1440, 968), gcd(1002, 703), gcd(2261, 1547) and gcd(779,

1763). S 10.7. Find lcm(1440, 968), lcm(1002, 703), lcm(2261, 1547) and

gcd(779, 1763).

S 10.8. Solve the following equations (in the set {0, . . . , n − 1} for (mod n)):
1+x=0 (mod 2), 3 × x = 1 (mod 2)
3+x=1 (mod 8), 3 − x = 6 (mod 8), 4 × x = 7 (mod 8).
5+x=3 (mod 11), 3 − x = 7 (mod 11), 4 × x = 8 (mod 11).
S 10.9. Find the ϕ(n) function for the numbers n = 19, 31, 28, 48, 144, 169, 1001.

S 10.10. Find the RSA key d for the public key e = 5, for n = 65.
10.4 Answers for Tutorial 10
Compulsory problems

C 10.1. (3,4,5), (5,12,13), (7, 24, 25), ( 8, 15, 17), ( 9, 40, 41).

C 10.2. 96 = 25 · 31; 144 = 24 · 32; 286 = 2 · 11 · 13; 777 = 3 · 7 · 37; 1001 = 7 · 11 ·

13.

C 10.3.

gcd(96, 144) = 24 · 3 = 48;

gcd(1001, 777) = 7;
gcd(1001, 286) = 11
· 13 = 143.

C 10.4.

lcm(96, 144) = 25 · 32 = 288;

lcm(1001, 777) = 3 · 7 · 11 · 13 · 37 =
111111; lcm(1001, 286) = 2 · 7 · 11 · 13 =
2002.

C 10.5.

1 (mod 2), 1 (mod 2)

0 (mod 5), 1 (mod 5), 1 (mod 5).
10 (mod 11), 7 (mod 11), 10 (mod 11).

C 10.6. One just needs to factorise the numbers and apply the multiplicity of
ϕ(n).
59
 ϕ(11) = 10;
ϕ(21) = ϕ(3 · 7) = ϕ(3) · ϕ(7) = 2 · 6 =
12; ϕ(21) = ϕ(3 · 7) = ϕ(3) · ϕ(7) = 2 ·
6 = 12; ϕ(24) = ϕ(23 · 3) = ϕ(23) · ϕ(3)
= 4 · 2 = 8; ϕ(36) = ϕ(22 · 32) = ϕ(22) ·
ϕ(32) = 2 · 6 = 12; ϕ(49) = ϕ(72) =

49(1 − 1/7) = 42; ϕ(81) = ϕ(34) =

81(1 − 1/3) = 54;
ϕ(100) = ϕ(22 · 52) = ϕ(22) · ϕ(52) = 2 · 20 = 40;

C 10.7. Each letter in the string needs to be shifted to the right by 10 positions.
If the transformed letter is after Z, we use the order:
A, B, C, D, . . . , X,Y, Z, A, B, C, . . .
Supplementary problems

S 10.1. 997.

S 10.2. Example: 4 = 2 + 2; 6 = 3 + 3; 8 = 3 + 5; 10 = 3 + 7; 12 = 5 + 7; 14 = 3 +
11; 16 = 3 + 13; 18 = 5 + 13; 20 = 3 + 17; . . . ; 96 = 7 + 89; 98 = 19 + 79; 100 = 3
+ 97.

S 10.3. (3,5), (5,7), (11,13), (17, 19), (29, 31), (41, 43), (59, 61), (71, 73), (101,
103).

S 10.4. 3, 7, 31, 127, 8191.

S 10.5.

703 = 19 · 37;
779 = 19 · 41;
968 = 23 · 112;
1002 = 2 · 3 · 167;
1440 = 25 · 32 · 5;
1547 = 7 · 13 · 17;
1763 = 41 · 43;
2261 = 7 · 17 · 19;

60
S 10.6. gcd(1440, 968) = 23 = 8; gcd(1002,
703) = 1;
gcd(2261, 1547) = 7 · 17 = 119;
gcd(779, 1763) = 41.

S 10.7.
lcm(1440, 968) = 25 · 32 · 5 · 112; lcm(1002,
703) = 2 · 3 · 19 · 37 · 167;
lcm(2261, 1547) = 7 · 13 · 17 · 19; lcm(779,
1763) = 19 · 41 · 43.

S 10.8.
x=1 (mod 2), x=1 (mod 2)
x = 6 (mod 8), x = 5 (mod 8), there is no such x.
x = 9 (mod 11), x = 7 (mod 11), x=2 (mod 11).
S 10.9. One just needs to factorise the numbers and apply the multiplicity of
ϕ(n).

ϕ(11) = 10;
ϕ(21) = ϕ(3 · 7) = ϕ(3) · ϕ(7) = 2 · 6 =
12; ϕ(21) = ϕ(3 · 7) = ϕ(3) · ϕ(7) = 2 ·
6 = 12; ϕ(24) = ϕ(23 · 3) = ϕ(23) · ϕ(3)
= 4 · 2 = 8; ϕ(36) = ϕ(22 · 32) = ϕ(22) ·
ϕ(32) = 2 · 6 = 12; ϕ(49) = ϕ(72) =

49(1 − 1/7) = 42; ϕ(81) = ϕ(34) =

81(1 − 1/3) = 54;
ϕ(100) = ϕ(22 · 52) = ϕ(22) · ϕ(52) = 2 · 20 = 40;

S 10.10. n = 65 then p = 5, q = 13 and ϕ(65) = 48. To find d one needs to solve 5

∗ d = 1 (mod 48) which gives d = 30.

61
11 Elements of Calculus
11.1 Brief theoretical background
Sequence: ordered list of objects. Discrete function x : N →X, x(n) = xn.

Limit of a sequence: value to which sequence terms ”get close to eventually”.

• We say that the sequence converges to the limit

• If a sequence does not converge it is divergent

Limit of a function: Suppose f : R →R is defined on the real line and p, L ∈ R.

We say ”the limit of f as x approaches p is L” and write

lim f(x) = L, x→p

if for every convergent sequence xn →p we have f(xn) →L.

Continuous function: A function f : R →R is continuous if

• for every point x and convergent sequence xn →x we have f(xn) →f(x).

• the graph is a single unbroken curve with no ”holes” or ”jumps”.

The intermediate value theorem:
If f is continuous on [a, b] and f(a)f(b) < 0 then there is c ∈ [a, b] s.t. f(c) = 0.

Derivative: measure of how a function changes as its input changes.

For x and x + h we define the ratio

∆f(x) f(x + h) − f(x) f(x + h) − f(x) m

===.
∆x (x + h) − (x) h

The derivative of the function f : R →R at x is the limit

f 0(x) = lim
f(x
+ h) − f(x) h→0 h
Differentiation of elementary functions

• powers: f(x) = xn(n ∈ N) : f 0(x) = nxn−1 • polynomials: (ax2 + bx + c)0 = 2ax

+ b (a, b, c: constants) • trigonometric functions:

62
 f(x) = sin(x) : f 0(x) =
cos(x) f(x) = cos(x) : f
0(x) = − sin(x) Definite
integral: Let the function f
defined on [a, b]. The
definite integral denoted
by

Zb
f
(
x
)
d
x

represents the area of the region in the xy-plane bounded by:

• the graph of f

• the x-axis,

• vertical lines x = a and x = b.

Fundamental theorem of calculus: If f is a continuous real-valued function
defined on [a, b] and a function F s.t. F0(x) = f(x), then the definite integral of f
over [a, b] is

Z b f(x)dx =
F(b) − F(a) a
Integration of elementary functions

• powers: f(x) = xn(n ∈ N) : F (constant)

• polynomials: f(x) = ax + b; F C
(a, b, C: constants)

• trigonometric functions:
Z
f(x) = sin(x) : F(x) = f(x)dx = − cos(x) + C
Z f(x)dx = sin(x) + C
f(x) = cos(x) :
F(x) =

Iterative method: trapezium rule

63
The region under the graph of function f : [a, b] → R is approximated as a
trapezoid

.
Numerical implementation: Dividing the interval [a, b] into N intervals we
define the

• Step: h (step);
• Partition: x0 = a, x1 = a + h, x2 = a + 2h,...,xN = a + Nh = b.
We apply the trapezium rule and obtain the following approximation for the
area

hN
∑ (f(xk−1)
2 k=1 b − a
+ f(xk)) a
= (f(x0) + 2f(x1) + 2f(x2) + . . . + 2f(xN−1) + f(xN)).
2N
11.2 Compulsory problems
C 11.1. Find the limit of the following sequences

(1) xn = 1; (2) xn = 1 + 1/n; (3 ) xn = 1/n2; (4) xn = 1/2n;

(5) 0.9, 0.99, 0.999, 0.9999, ...;
(6) 0.23, 0.23, 0.2323, 0.232323, ...;
(7) 0.423, 0.42323, 0.4232323, 0.423232323, ...

C 11.2. Prove that f(x) = 2x2 + 2x − 5 has a root in the intervals [1, 2] and [-3,-2].

C 11.3. Prove that the cubic function f(x) = 2x3 + 2x2 − 3 has a root x0 ∈ [0, 1].

C 11.4. Differentiate the following functions: (1) f(x) = 2x + 1; (2) f(x) = 2x2 + 3.

C 11.5. Integrate the functions: (1) f(x) = 1; (2) f(x) = 2x + 3; (3) f(x) = 2x2 + 3.

C 11.6. Evaluate dx for f(x) = x2 + 2 using Fundamental theorem of calculus.

C 11.7. Evaluate dx for f(x) = x2 + 2 using the trapezium rule for 2, 4

intervals.

11.3 Supplementary problems

S 11.1. Find the limit of the following sequences

64
 2n
(1) xn = ;
n−4

(2) xn = (−1)n 2n ;
n!
(3) xn = n2 − 5n;
√ √
(4) xn = n + 1 − n.

S 11.2. Find the number of real roots of f : R →R given by f(x) = 8x3 +12x2 −2x−3.

S 11.3. Prove that the function f 2 has a root x0 ∈ [0, 1].

S 11.4. Differentiate the function f(x) = 2x3 + 7x + 3.

S 11.5. Integrate the functions: (1) f(x) = 2x + 7 cos(x)+ 3 sin(x); (2) f(x) = 2x3 +

1. S 11.6. Find the area between the curves f(x) = −x2 + 6x − 2 and g(x) = 2x + 1.

S 11.7. Evaluate the integral dx for f(x) = x3 + 4x2 − 5x − 2 exactly and by

using the trapezium rule for 2, 4, 8. What can you say about the result ?
11.4 Answers for Tutorial 11
Compulsory problems

C 11.1. (1) 0; (2) 0; (3) 0; (4) 0; (5) 1; (6) 23/99; (7) 423/990.

C 11.2. f(1)f(2) = (−1)7 < 0; f(−3)f(−2) = (7)(−1) < 0.

C 11.3. f(0)f(1) = (−3)1 < 0.

C 11.4. (1) f 0(x) = 2; (2) f 0(x) = 4x.

C. The integral is therefore given by

C 11.7. When N = 2 we have h = 2/2 = 1 and the formula gives the

approximation

65
When N = 4 we have h = 2/4 = 1/2 and the formula gives the approximation
T

Supplementary problems

S 11.1. (1) 2; (2) 0; (3) ∞; (4) 0.

S 11.2. f(−2) = −11; f(−1) = 3; f(0) = −3; f(1) = 15.

We have f(−2)f(−1) < 0, f(−1)f(0) < 0 and f(0)f(1) < 0.

S 11.3. f(0)f(1) = (−1)3 < 0.

S 11.4. f 0(x) = 6x2 + 7.

S 11.5. (1) R f(x)dx = x2 + 7 sin(x) − 3 cos(x); (2) R f(x)dx = x4/2 + C.

S 11.6. We first solve f(x) = g(x) and obtain the solutions x1 = 1, x2 = 3. A

Conclusion: precision always gets close to the actual result (eventually).

66