Mathematics Mid - Exam
1 Questions Code # 1
Bule Hora University
College of Natural and Computational Science
Department of Mathematics
Mathematics for freshman Students’ Mid - Exam
Exam - Date : 10/12/2013 E.C Max. Mark : 20 %
Jot down your answers neatly and legibly !! Time allowed : 1:30 hr
Name : Id No.: Group : Stream :
Part I : Write true if the statement is correct else False. (1 pt each)
1. If two sets are equal set, then they are equivalent set.
2. Empty set is a subset of any set.
3. If x ∈ (B\A), then x ∈
/ B and x ∈ A
4. Let U = {x : x ∈ Z and −3 ≤ x ≤ 3} and P (x) : 1 − x2 ≤ 0, then P (x) is tautology.
Part II : Put the most simplified answer on the space provided (1 pt each)
1. How many elements does A contain if it has 255 proper subsets?
2. Let A = {1, {2}, {1, 2}} and B = {1, {1, 2, 3}}. Then find A∆B =
3. Given that p : Man is mortal q : 19 is prime number.
s : 0 is natural number. t : 1 is a composite number.
Then determine the truth value of (p ∧ s) ⇔ (¬t ∨ s) ⇒ ¬q
4. Let B = {a, {b, c}}. Then compute P (B) =
Part III : Choose the best answer from the given alternatives. (1 pt each)
1. Which of the following quantifiers has truth value ”False” on the set of real numbers?
Page 1 of 4
Mathematics Mid - Exam
(a) (∃x)(∀y)(x + y = y) (c) (∀x)(∀y)(x2 + y 2 ≤ 0)
(b) (∃x)(∃y)(x + y = 5) (d) (∃x)(∀y)(x + y = y)
2. Which of the following is proposition?
(a) Give me that book! (c) 2 is less than 1.
(b) Come here! (d) What is your name?
3. Which of the following is the negation of (∀x)[P (x) ⇒ Q(x)]?
(a) (∃x)[¬P (x) ∧ ¬Q(x)] (c) (∃x)¬[¬P (x) ∨ Q(x)]
(b) (∃x)[¬P (x) ⇒ Q(x)] (d) (∃x)[P (x) ⇒ Q(x)]
4. Suppose that P (x) : x is even number, Q(x) : x is prime number and R(x) : x is divisible by 2.
Which of the following has truth vale ”F” on the set of Natural numbers?
(a) (∃x)[P (x) ∧ Q(x)] (c) (∀x)[P (x) ⇒ Q(x)]
(b) (∀x)[P (x) ∨ ¬R(x)] (d) (∃x)[P (x) ∧ ¬R(x)]
Part IV : Workout(Show all necessary steps neatly and legibly !!) (2 pts each)
1. Identify whether the following compound statement is tautology, contradiction or neither.
((p ⇒ q) ∧ (p ⇒ r)) ⇒ (p ⇒ r)
2. Use formal proof to test the validity of the following argument.
If the team is late, then it cannot play the game. If the referee is here, then the team can play the
game. The team is late. Therefore, the referee is not here.
3. Use truth table to test the validity of p ⇒ q, q ⇒ r, ¬r ⊢ ¬p
4. Write the contrapositive, inverse and the converse of the following conditional statement.
”If Gemechu is healthy, then he is happy.”
Page 2 of 4
Mathematics Mid - Exam
2 Solutions Code # 1
Part I : True/False Item
1. True
2. True
3. False
4. False
Part II : Blank Space Item
1. 8
2. {{2}, {1, 2}, {1, 2, 3}}
3. True
4. {φ, {a}, {{b, c}}, {a, {b, c}}}
Part III : Multiple choice Item
1. D
2. C
3. C
4. C and D
Part IV : Workout Item
1. Forward
p q r (p ⇒ q) (q ⇒ r) ((p ⇒ q) ∧ (q ⇒ r)) ⇒ (p ⇒ r)
T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F
Page 3 of 4
Mathematics Mid - Exam
2. Let p : The team is late
q : The team can play the game
r : The referee is here
p → ¬q, r ⇒ q, p ⊢ ¬r
Using formal proof here is the proof
(a) p → ¬q = T(∵ P remise)
(b) r ⇒ q = T(∵ P remise)
(c) p = T(∵ P remise)
(d) ¬q = T(∵ Modes Ponenes using (a) and (c))
(e) ¬r = T(∵ Modes Tollens using (b) and (d))
Since all premises T implies conclusion T we say the p → ¬q, r ⇒ q, p ⊢ ¬r is Valid
3. Forward
p q r ¬p ¬r (p ⇒ q) ∧ (q ⇒ r) (p ⇒ q) ∧ (q ⇒ r) ∧ ¬r ((p ⇒ q) ∧ (q ⇒ r) ∧ ¬r) ⇒ ¬p
T T T F F
T T F F T
T F T F F
T F F F T
F T T T F
F T F T T
F F T T F
F F F T T
4. Contrapositive : If he is not happy, then Gemechu is not healthy.
Inverse : If Gemechu is not healthy, then he is not happy.
Converse : If he is happy, then Gemechu is healthy.
Page 4 of 4
