1

MATH2081
-
MATHEMATICS FOR
COMPUTING
-
MID-SEMESTER TEST

Exam Date: 23rd July 2012

Reading Time: 9.00 9.10

Writing Time: 9.10 10.10

Examination Room: 1.4.20

Name:

ID No:

Group:

RULES

1. Calculators must not be taken into the examination room.

2. There are 6 questions. You must answer only 5 of them. There is a total of 100
marks. Each question is worth 20 marks. Please write at the bottom of this page
which question you choose not to answer.

3. Show all your work to get full marks. Even if your answer is incorrect, you might
get partial credit for the right way of reasoning.

4. This examination contributes 20% to the total assessment of the Math2081 course.

5. There are total 8 pages (including cover) in this booklet.

THE QUESTION THAT I CHOOSE NOT TO ANSWER IS:
2

Question 1: (10 + 10 Marks)

a) Write down the following sets and then draw them into a Venn diagram.
i) A = { x | x e N, x s 12, x is even }
ii) B = { 3*y | y e N, 1 s y s 7 }
iii) C = { z
2
| z eZ, -5 < z < 5 }

b) Prove the following. Let A, B be finite sets. Then | A | + | B | = | A B | iff A B = C.

a) A = {0, 2, 4, 6, 8, 10, 12}; B = {3, 6, 9, 12, 15, 18, 21}; C = {0, 1, 4, 9, 16}














b) Proof: Let | A | = n and | B | = m, and A = {a
1
, a
2
, ..., a
n
} and B = {b
1
, b
2
, ..., b
m
}.
Assume A B = C, A B = {b
1
, , b
k
} and let | A B | = k, k > 1. We have | A | + | B | = n +
m. But then | A B | = n + m k, since A B = {a
1
, , a
m
, b
k+1
, , b
m
}. Since k > 1, n + m = n + m
k, and hence | A | + | B | = | A B |.
: Let A B = C. Then we get A B = {a
1
, a
2
, ..., a
n
, b
1
, b
2
, ..., b
m
}, by definition of and
hence | A B | = n + m = | A | + | B |.






A B
C
0, 4 9
6, 12
2, 8, 10
3, 15, 18,
21
1, 16
3

Question 2: (10 + 10 Marks)

a) Let o _ A x A be a relation. Define the inverse relation o
-1
= { (b, a) | (a, b) e o}. Prove the
following. If o is symmetric, then o
-1
is symmetric.

b) Let o _ N x N by defined by o = { (x, y) | x s y + 4 }. Is o reflexive, symmetric, and transitive?
Is o an equivalence relation? Prove your claims.

a) So let o be symmetric. Now let (a, b) e o
-1
. By definition of o
-1
we get that (b, a) e o. Since o is
symmetric, we have (a, b) e o. Again by definition of o
-1
we get (b, a) s o
-1
. Hence o
-1
is symmetric.

b) Reflexive: since, for all x e N we have x s + 4, we get (x, x) e o.
Not symmetric: we have (10, 15) e o but (15, 10) e o, since not 15 s 10 + 4.
Not transitive: We have (10, 7) e o and (7, 4) e o, but obviously (10, 4) eo, since not 10 s 4 + 4.
So o is no equivalence relation.


4

Question 3: (10 + 10 Marks)

Let a e R, a = 0, and let f : R
>0
R
>0
be defined by () .

a) Is f one-one, onto, bijective? Prove your claims.

b) Does f have an inverse function? If so, find it and prove your claims. If not, prove that f can
not have an inverse function.


a) One-one: Let x = y. Then x/a = y/a and = . So f(x) = f(y).
Onto: Let y e R
>0
be given. Define x = a * y
2
. Then () (

) (

Since f is one-one and onto, f is bijective.

b) Define f
-1
(x) = a * x
2
. Let x e R
>0
be given. Then

(())

() ()

.





5

Question 4: (5 + 5 + 5 + 5 Marks)

a) Simplify | 3 | x + 7 | | for 7 < x < 4
b) Solve for x: | 8 | x 3 || = 4
c) Express x in terms of k: 3
k-2
+ 2 < x < 3
k-1
+ 2
d) Solve for x: 10
x-2
+ 20 = 50

a) | 3 | x + 7 | | = | 3 (x + 7) | (since x + 7 > 0 for -7 < x < -4) = | 4 x | = 4 x since 4 x > 0 for
7 < x < 4.

b) Case 1: 8 | x 3 | = 4 | x 3 | = 4. Case 1.1: x 3 = 4 x = 7. Case 1.2: x 3 = 4 x = 1.
Case 2: 8 | x 3 | = 4 | x 3 | = 12. Case 2.1: x 3 = 12 x = 15. Case 2.2: x 3 = 12 x = 9.
Hence x e {-9, -1, 7, 15}.

c) 3
k-2
+ 2 < x < 3
k-1
+ 2 3
k-2
< x 2 < 3
k-1
log
3
(3
k-2
) < log
3
(x 2) < log
3
(3
k-1
) k 2 < log
3
(x
2) < k 1 k 1 < log
3
(x 2) + 1 < k. Hence k = log
3
(x 2) + 1 ( .

d) 10
x-2
+ 20 = 50 10
x-2
= 30 x 2 = log 30 x = 2 + log 30






6
Question 5: (10 + 10 Marks)

a) Express using summation and/or production symbols; do not compute.

1) 13 + 12 + 11 + ... + 1 + 0 + (-1) + (-2) =

2) 2 * 6 * 12 * 20 * ... =

3) -3 + 6 9 + 12 15 + ... =

4) 1 + 22 + 333 + 4444 + ... + 999999999 =

b) Prove or disprove the following. Let n e N, n > 2, x
1
, ..., x
n
e N. Then

.


a)
1)

2) ( )

3) ()

4)

( )

b) This is not true. For example, let n = 2, x
1
= 1 and x
2
= 3. Then

( )

( ) ( )

. (Most people actually used

, which is also not true.)

7
Question 6: (10 + 10 Marks)

a) Use the Gauss Jordan Algorithm to compute A
-1
for the matrix [


].

b) Prove that for all 2x2 matrices A and B we have that (A * B)
T
= B
T
* A
T
.


a) {


|


} {


|


} (Row 1 2*Row 2) {


|


} (Row 2 /(-3))
{


|


} (Row 1 2*Row 2)

So the inverse matrix is [


].

b) Just compute both sides. Let [


] and [


]. Then (A * B)
T
=
[


]

[


] . Now compute B
T
* A
T
= [


]

[


]

[


] [


] [


]. Since both sides are equal, the claim is proven.



8


Extra sheet