1. { 10 points } Construct truth tables for the following statement forms.

∼ p ∨ (q ∧ r) and ∼p∨r →q

p q r ∼p q∧r ∼ p ∨ (q ∧ r) ∼p∨r p∨r →q

T T T F T T T T

T T F F F F F T

T F T F F F T F

T F F F F F F T

F T T T T T T T

F T F T F T T T

F F T T F T T F

F F F T F T T F

2 The statements are equivalent

Check the appropriate box:
X The statements are not equivalent

2. { 10 points } Write negations of the following statements.

(A) Today is Thursday and this test is easy.

Today is not Thursday or this test is not easy.

(B) If Helen lives in Athens, then she lives in Greece.

Helen lives in Athens and she does not live in Greece.

3. { 10 points } Use the truth table to determine whether the following argument
is valid.
r
p∨q
p→r
∴ p →∼ q

p q r p∨q p→r ∼q p →∼ q

T T T T T critical row F F

T T F T F

T F T T T critical row T T

T F F T F

F T T T T critical row F T

F T F T T

F F T F T

F F F F T

2 The argument is valid

Check the appropriate box:
X The argument is not valid
Explain: p →∼ q is not true on one of the critical rows (the first one).

4. { 10 points } Indicate whether the following argument is valid or invalid.

All people are mice.
All mice are mortal.
∴ All people are mortal.
X The argument is valid. 2 The argument is not valid.
Support your answer by drawing diagrams:
5. { 10 points } Rewrite the statements formally using quantifiers and variables,
and write a negation for each statement.
(A) All roses are red.
formally: ∀x ∈ { roses }, x is red.

negation: ∃x ∈ { roses }, x is not red.

or There is a rose which is not red.

(B) For any rational number, there is an integer which is greater than it.
formally: ∀x ∈ Q , ∃n ∈ Z : n > x .

negation: ∃x ∈ Q : ∀n ∈ Z , n ≤ x .

6. { 10 points } Prove the statement.

r
For all rational numbers r and s , if s 6= 0 then s is rational.
Let r and s be arbitrary rational numbers. Then there are integers a,
a c
b 6= 0, c, and d 6= 0 such that r = and s = . In addition, we have that
b d
r ad
c 6= 0 , since s 6= 0 . So, = . But ad and bc are integers, and bc 6= 0
s bc
r
because of b 6= 0 and c 6= 0 . Therefore is rational.
s

7. { 10 points: +2 points for a right answer, −1 point for a wrong one, 0 points if none or both of
the boxes are checked. In case the total is negative, 0 points will be given for this problem. }
For each of the following statements determine whether it is true or false.
It is not necessary to justify your answers.

(A) The difference of any two odd integers is odd. false

(B) For all integers a, b, and c, if a | (b + c) then a | b and a | c. false

(C) For all integers a, b, and c, if a | b then a | bc . true

(D) There is no greatest negative real number. true

(E) For all integers n and m, if n − m is even then n3 − m3 is even. true

8. { 10 points } Prove the statement.
For all integers n, if n2 is odd then n is odd.

We shall prove a statement that is equivalent to it. First, we formulate the

contrapositive statement:
For all integers n , if n is not odd then n2 is not odd.
Then, using that if an integer is not odd then it is even, we rephrase the
statement as follows:
For all integers n , if n is even then n2 is even.
To prove the last statement, we let n be arbitrary even integer. Then there
exists an integer k such that n = 2k. Therefore n2 = (2k)2 = 4k 2 = 2(2k 2 )
is even, since 2k 2 is an integer.

9. { 10 points: +2 points for a right answer, −1 point for a wrong one, 0 points if none or both of
the boxes are checked. In case the total is negative, 0 points will be given for this problem. }
For each of the following statements determine whether it is true or false.
It is not necessary to justify your answers.

(A) For all odd integers n, dn/2e = (n + 1)/2 . true

(B) For all real numbers x and y, dxye = bxc dye . false
√
(C) 3 is irrational. true
√
(D) 4 is irrational. false

(E) For any integer a, 4/|(a2 − 2) . true

10. { 10 points } Transform each of the following by making the change of variable.
(A) j =m+1
8 µ ¶ 8+1 µ
X ¶ X 9 µ ¶
X 1 1 1 1 1 1
− = − = − .
m=3
m m+1
j=3+1
j − 1 j j=4
j − 1 j

(B) i=k−1
n+1−1
Y (i)2 n
Y
Y
n+1
(k − 1)2 (i)2
= = .
k=2
k i +
i=2−1
1 i + 1 i=1
First Bonus Problem. { 10 points } Prove the statement by mathematical induction.
For all integers n ≥ 1
X
n
n2 (n + 1)2
i3 = .
i=1
4

A solution is to be added soon.

Second Bonus Problem. { 10 points } Sometimes you do not know whether some
statements are true or false. Suppose that p and q are such statements, and
try to get as many points as possible even in the worst case scenario.

(A) { +2 points for a right answer, −1 point for a wrong one, 0 points if none or both
of the boxes are checked }

p 2 true false 2

q 2 true false 2

∼q 2 true false 2

p∨q 2 true false 2

p∧q 2 true false 2

p→q 2 true false 2 A solution is to be added soon.

(B) Explain your strategy in (A).

A solution is to be added soon.

(C) Can you get positive number of points in the worst case, if the rules are
the following
{ +1 point for a right answer, −1 point for a wrong one, 0 points if none or both of the boxes
are checked } ?
Why?
A solution is to be added soon.