Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
59 views

Math2081 2010C Midterm Sol

The document is an exam for a mathematics course. It provides instructions for the exam, which contains 6 questions of which students must answer 5. It gives the first 2 exam questions, which involve sets, logic, and functions. The first question has students compute sets and prove De Morgan's law. The second asks students to analyze relations and provide an example of one that is not reflexive, symmetric, or transitive.

Uploaded by

Triet Nguyen
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
59 views

Math2081 2010C Midterm Sol

The document is an exam for a mathematics course. It provides instructions for the exam, which contains 6 questions of which students must answer 5. It gives the first 2 exam questions, which involve sets, logic, and functions. The first question has students compute sets and prove De Morgan's law. The second asks students to analyze relations and provide an example of one that is not reflexive, symmetric, or transitive.

Uploaded by

Triet Nguyen
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

1

MATHEMATICS FOR

COMPUTING SCIENCE

MID-SEMESTER TEST

Exam Date: 25
th
November 2010

Reading Time: 9:00 am 9:10 am

Writing Time: 9:10 am 10:10 am

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. Total mark is 100. 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 Math 2081 course.

1. 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) Let A = {x e N | 0 < 2x < 5} and B = {x e Z | |x| < 4} be sets.
Compute A, B, A \ B, A B, A B

b) Prove the following: Let A, B be sets. Then

(This is one of DeMorgans


laws. Prove it; do not just write follows from lecture.)


a) A = {1, 2}, B = { -3, -2, -1, 0, 1, 2, 3}, A \ B = C, A B = A, A B = B (2 Marks each)

b) To show = we show both _ and _.

_: Let

.

Case 1: x e A x e B since x e A B x e

by definition x e

for any set

.
Case 2: x e B is symmetric.
Case 3: x e A or x e B x e

or x e

by definition x e

.
Since there are no more cases, we are done.

_: Let x e

.

Case 1: x e

, since A B _ A and hence


Case 2: x e

, since A B _ A and hence


There are no more cases and hence we are done.

From both _ and _ we get the claim.

(10 Marks. There are many ways to prove this. Partial marks will be awarded.)

3

Question 2: (10 + 10 Marks)

a) Let = { (x, y) | x = y; x, y e N}. Is reflexive/symmetric/transitive? Is an equivalence
relation? Prove your claims.

b) Give an example of a relation that is not reflexive, not symmetric, and transitive. Prove your
claims.

a) This relation is not reflexive, since, for example, (1, 1) is not in . It is symmetric, since if x = y,
then y = x. It is not transitive, since (4, 5) e and (5, 4) e , but (4, 4) e . Since the relation is
neither reflexive nor transitive, it is no equivalence relation. (3+3+3+1 Marks)

b) For example define = {(x, y) | x > y; x, y e N}. Since never x > x, is not reflexive. Also is
not symmetric, since 5 > 4 but not 4 > 5. Finally, is transitive, since if a > b and b > c, then
obviously a > c. (4 Def + 2 + 2 + 2 Marks)


4

Question 3: (10 + 10 Marks)

Let f : R
+
(2, ) be defined by f(x) = x
2
2.

a) Is f one-one, onto, bijective? Prove your claims.
b) Compute the inverse function of f. Prove your claims.

a) f is one-one: Let x = y. Then x
2
= y
2
, sine x > 0 and y > 0. Then x2 2 = y2 2, and therefore f(x)
= f(y). Hence f is one-one. Furthermore, f is onto: let any y e (-2, ) be given. Then let x
= . Then f(x) =

Since f is one-one and onto, f is


bijective. (4 + 4 + 2 Marks)

b) Basically, we have done that already in the first part. Define f
-1
: (-2, ) R
+
by


. Then f is total on domain f, since x + 2 > 0 and therefore f
-1
(x) is defined. We have to
show f
-1
(f(x)) = x for all x e domain f. So let x e domain f be given. Then f
-1
(f(x)) = f
-1
(x
2
2) =

(5 marks for definition + 5 marks for proof)




5

Question 4: (6 + 6 + 8 Marks)

a) Express the following series with summation and/or product symbols. Do not compute the
results.

1. 1 + 4 + 9 + + 225 =



2. (2) * (2 + 4) * (2 + 4 + 6) * * (2 + 4 + 6 + + 20) =



3. 0 + 2 + 6 + 12 + 20 + + 380 =

(2+2+2 Marks)


b) Evaluate the following expressions; show your computation steps. (3+3 Marks)

1. 3x 2 = 6s3x-2s7 8sxs9 2/3sxs8

2. 3 - e( = 2<e<3-2>-e>-33-2>3-e>3-31>e>0, so 3 - e( = 1 (e = 2.7182)

c) Prove that x + y s x + y s x + y + 1 for all x, y e R.

Obviously 0 s | x x| < 1for all x. Let a = | x x| + | y y|. Hence 0 s a < 2. If 0 s a < 1, then
x + y = x + y, by definition of the floor function. If 1 s a < 2, then x + y = x + y +1,
again by definition of the floor function. Since there are no more cases, we are done. (8 Marks,
marks for partial solutions)


6

Question 5: (10 + 10 Marks)
a) A skateboarder goes down a half-pipe. Every time he goes up the other side half of what he
travelled down on this side. If the half-pipe is 40m long in total, how much distance will he cover,
if he just keeps rolling?


b) Prove the following: Let a
n
e R and b
n
e R for all n e N. If a
n
< b
n
for all n e N, and furthermore

then



a) He travels (20 + 10) + (10 + 5) + (5 + 2.5) + = 20 + 20 + 10 + 5 + = 20 + 20(1 + + + 1/8 +
) = 20 + 20 *

meters. (10 Marks; partial marks


awarded according to progress.)

b) Of course, A < B iff 0 < B A. Since we know a
n
< b
n
for all n e N, we can always find c
n
> 0, c
n
e R
such that b
n
= a
n
+ c
n
; (*). Hence we get:


So A < B iff 0 < B A iff 0 < C. But 0 < C is obvious, since all c
n
> 0 by assumption. So the claim is
proved. (10 Marks, partial marks awarded; other solutions are possible.)


First time
Second time
40m distance
etc
7


Question 6: (10 + 10 Marks)

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


].

b) Let [



]. Compute M
2
and M
3
. What will M
n
look like for n > 3? Explain.

a) {


|


} {


|


} (Row 2 2 x Row 1) {


|


} (Row 2 divided
by -7) {


|


} (Row 1 5 x Row 2). So the inverse matrix is [


].
(9 marks for steps, 1 mark for making inverse explicit in some way.)

b)

[



],

[



]. From now on, all matrices M
n
will be completely zero.
(4 marks each matrix, 2 marks for conjecture.)



8

Extra sheet

You might also like