Learning Resource Center

University of the Philippines Baguio

UP Baguio Office: Tel. (074) 444-8720

Mathematics 29 1st Long Exam Reviewer Guide

2nd Semester, Academic Year 2021-2022

I. TRUE or FALSE. Write TRUE is the statement is always true, otherwise, FALSE.
1. The statement (P ∧ Q) ∨ (P ∨ Q) is true whenever at least one among statements P and Q is true.
2. The implication P ⇒ Q is false whenever P or Q is false.
3. The statement (P ∨ Q) ∧ ¬(P ∧ Q) is equivalent to the statement (P ∧ ¬Q) ∨ (¬P ∧ Q).
4. Showing that the hypothesis of a conditional statement is false implies the validity of the statement.
5. A statement without any counterexample is a tautology.
II. LOGIC. Provide NEAT and COMPLETE solutions/proof to the following problems.

1. Prove that the following statements are tautologies:

a. [(p ⇒ q) ∧ (q ⇒ r)] ⇒ (p ⇒ r)
b. ¬q ∧ (p ⇒ q) ⇒ ¬p
2. Negate the following statement: Given ε > 0, there exists δ > 0 such that if 0 < |x − a| < δ, then |f (x) − L| < ε.
3. Find a counterexample for the following statements:
a. (¬p ∨ q) ⇒ r
b. ¬(¬p ⇔ s) ∧ (q ∨ r)
4. If Math 29 is easy, then Math 29 classes are shorter. If Math 29 is not easy but the lessons are interesting, then taking
Math 29 is fulfilling. Math 29 classes are not shorter relative to other Math electives. Show that Math 29 is fulfilling if it
is taught interestingly, by logic laws.
III. METHODS OF PROOF. Provide NEAT and COMPLETE solutions/proof to the following problems.
1. Let x ∈ Z. Prove directly that if x2 − 4x + 2 is divisible by 7, then x3 − 27 is also divisible by 7.
2. Prove: xy + 1 is even if and only if x and y are both odd.
3. If a positive integer n = 4k + 2 or n = 4j + 3, for some integers k and j, then n is not a perfect square.
4. Prove that 25k 2 − 15k is an even integer whenever 5k − 3 is an integer.
n
X
5. Prove that for any positive integer n, k2k = (n − 1)2n+1 + 2
k=1
6. Find a formula for the total number of squares on a n − by − n square grid. Prove your conjecture using mathematical
induction.
7. Prove: ∀xp(x) ∨ ∀xq(x) =⇒ ∀x(p(x) ∨ q(x)). Does the converse also hold?

END OF REVIEWER
kbramos7, kpraposas
LRC Math 29 1st Semester A.Y. 2021-2022
 Learning Resource Center
University of the Philippines Baguio
UP Baguio Office: Tel. (074) 444-8720

Mathematics 29 1st Long Exam Reviewer Guide

2nd Semester, Academic Year 2021-2022

I. TRUE or FALSE. Write TRUE is the statement is always true, otherwise, FALSE.
1. The statement (P ∧ Q) ∨ (P ∨ Q) is true whenever at least one among statements P and Q is true. Ans: TRUE
2. The implication P ⇒ Q is false whenever P or Q is false. Ans: FALSE
3. The statement (P ∨ Q) ∧ ¬(P ∧ Q) is equivalent to the statement (P ∧ ¬Q) ∨ (¬P ∧ Q). Ans: TRUE
4. Showing that the hypothesis of a conditional statement is false implies the validity of the statement. Ans: TRUE
5. A statement without any counterexample is a tautology. Ans: TRUE
II. LOGIC. Provide NEAT and COMPLETE solutions/proof to the following problems.

1. Prove that the following statements are tautologies:

(a) [(p ⇒ q) ∧ (q ⇒ r)] ⇒ (p ⇒ r)
p q r [(p ⇒ q) ∧ (q ⇒ r)] ⇒ (p ⇒ r)
T T T T T T T T
T T F T F F T F
T F T F F T T F
Ans: T F F F F T T F
F T T T T T T T
F T F T F F T T
F F T T T T T T
F F F T T T T T
The truth values under the main column are all true hence the statement is a tautology.
(b) ¬q ∧ (p ⇒ q) ⇒ ¬p
p q ¬p ¬q ¬q ⇒ (p ⇒ q) ⇒ ¬p
T T F F F T T
Ans: T F F T F F T
F T T F F T T
F F T T T T T
The truth values under the main column are all true hence the statement is a tautology.
2. Negate the following statement: Given ε > 0, there exists δ > 0 such that if 0 < |x − a| < δ, then |f (x) − L| < ε.
Ans: There exists ε > 0 for all δ > 0 such that |f (x) − L| ≥ ε whenever 0 < |x − a| < δ.
3. Find a counterexample for the following statements:
(a (¬p ∨ q) ⇒ r
Ans: pT qT rF, pF qT rF, pF qF rF
(b ¬(¬p ⇔ s) ∧ (q ∨ r)
Ans: pT sT qT rT, pT sT qT rF, pT sT qF rT, pT sT qF rF, pT sF qF rF, pF sT qF rF, pF sF qT rT,
pF sF qT rF, pF sF qF rT, pF sF qF rF
4. If Math 29 is easy, then Math 29 classes are shorter. If Math 29 is not easy but the lessons are interesting, then taking
Math 29 is fulfilling. Math 29 classes are not shorter relative to other Math electives. Show that Math 29 is fulfilling if it
is taught interestingly, by logic laws.
Ans: Let

p : Math 29 is easy.
q : Math 29 classes are short.
r : Math 29 is interesting.
s : Math 29 is fulfilling.

Then we have the following set of premises: p ⇒ q, ¬p ∧ r ⇒ s, ¬q, and the additional premise, (p ⇒ q) ⇔
(¬q ⇒ ¬p).
Prove: r ⇒ s.
1. r (H)
2. p ⇒ q (Pr)
3. ¬p ∨ q (Or-form)
4. q ∨ ¬p (Commutativity of ∨)
5. ¬q =⇒ ¬p (Or-form)
6. ¬q (Pr)
7. ¬p (MP)
8. ¬p ∧ r (Adj)
9. ¬p ∧ r ⇒ s (Pr)
10. s (DPI)
III. METHODS OF PROOF. Provide NEAT and COMPLETE solutions/proof to the following problems.
1. Let x ∈ Z. Prove directly that if x2 − 4x + 2 is divisible by 7, then x3 − 27 is also divisible by 7.
Ans: Assume that x2 − 4x + 2 is divisible by 7 for some x ∈ Z, i.e. x2 − 4x + 2 = 7k for some k ∈ Z. Now,
we need to show that x3 − 27 is also divisible by 7, i.e. x3 − 27 = 7j for some j ∈ Z

Proof.

x2 − 4x + 2 = x2 − 7x + 3x + 9 − 7
= x2 + 3x + 9 − 7(x + 1)

Since x2 − 4x + 2 is divisible by 7, then x2 − 3x + 9 must also be divisible by 7, i.e x2 + 3x + 9 = 7m for some m ∈ Z.

Now,

x3 − 27 = (x − 3)(x2 + 3x + 9)
= (x − 3)(7m)
= 7(m)(x − 3)
= 7j

We have shown that x3 − 27 = 7j where j = m(x − 3) ∈ Z. Therefore, it is proven that if x2 − 4x + 2 is divisible by

7, then x3 − 27 is also divisible by 7

2. Prove: xy + 1 is even if and only if x and y are both odd.

Ans: Proof. (⇒) We prove by contraposition. WLOG, suppose x is even. Then x = 2k for some k ∈ Z. Note that
y = 2l + 1 of some l ∈ Z. Then

xy + 1 = (2k)(2l + 1) + 1 = 2(2kl + l) + 1 = 2m + 1

is odd, since m = 2kl + l is an integer. By contraposition, xy + 1 is even if x and y are both odd.
(⇐) Let x, y be odd integers, i.e., x = 2k + 1 and y = 2l + 1 for some k, l ∈ Z. Then

xy + 1 = (2k + 1)(2l + 1) + 1 = 4kl + 2k + 2l + 2 = 2(2kl + k + l + 1) = 2m,

is even, since m = 2kl + k + l is an integer.

3. If a positive integer n = 4k + 2 or n = 4j + 3, for some integers k and j, then n is not a perfect square.
Ans: We proceed by proving the contrapositive: If n is a perfect square, then n ̸= 4k + 2 or n ̸= 4k + 3 for
some integers kand j.

Proof. Let n = a2 for some a ∈ Z.

• Case1. When a is even, i.e a = 2x for some x ∈ Z

a = 2x ⇒ n = a2 = 4x2 . In this case, n ̸= 4k + 2 or n ̸= 4k + 3.
• Case2. When a is odd, i.e a = 2y + 1 for some y ∈ Z
a = 2y + 1 ⇒ n = a2 = 4y 2 + 4y + 1 = 4(y 2 + y) + 1. In this case, n ̸= 4k + 2 or n ̸= 4k + 3.
For all possible cases when n is a perfect square, n ̸= 4k + 2 or n ̸= 4k + 3. Hence, the statement: If n is a perfect
square, then n ̸= 4k + 2 or n ̸= 4k + 3 for some integers kand j is true. Therefore, by contraposition, if a positive integer
n = 4k + 2 or n = 4j + 3, for some integers k and j, then n is not a perfect square.

4. Prove that 25k 2 − 15k is an even integer whenever 5k − 3 is an integer.

Ans: Proof. Observe that

25k2 − 15k = (25k2 − 30k + 9) + 3(5k − 3) = (5k − 3)2 + 3(5k − 3),

so we let n = 5k − 3. The problem becomes n2 + 3n is even if n is an integer. If n is an even integer, then n = 2k for
some integer k. Then

n2 + 3n = 4k2 + 6k = 2(2k2 + 3k) = 2l

is an even integer, since l = 2k2 + 3k is an integer. If n is odd, i.e., n = 2k + 1 for some integer k, then

n2 + 3n = (4k2 + 4k + 1) + 3(2k + 1) = 4k2 + 10k + 4 = 2(2k2 + 5k + 2) = 2l

is an even integer, since l = 2k2 + 5k + 2 is an integer.

n
X
5. Prove that for any positive integer n, k2k = (n − 1)2n+1 + 2
k=1
Ans: We proceed using proof by mathematical induction.

Proof. • Basis Step. Let n = 1.

1
X
(1)21 = (1 − 1)21+1 + 2
k=1
2 = (0)22 + 2 = 2

The statement is certainly true for n = 1

 n
X
• Induction Step. Assume that for any positive integer n, k2k = (n − 1)2n+1 + 2 is true for k ≥ 1.
k=1
n+1
X
Now, we need to show that k2k = (n)2n+2 + 2.
k=1
Note that,
n+1
X n
X
k2k = k2k + (n + 1)2( n + 1) = (n − 1)2n+1 + 2 + (n + 1)2n+1 = 2n+1 (n − 1 + n + 1) + 2
k=1 k=1
n+1
=2 (2n) + 2 = (n)2n+2 + 2

n+1
X
We have verified that k2k = (n)2n+2 + 2. Therefore, by the principle of mathematical induction, for any positive
k=1
n
X
integer n, k2k = (n − 1)2n+1 + 2 for some integer k ≥ 1.
k=1

6. Find a formula for the total number of squares on a n − by − n square grid. Prove your claim using mathematical induction.
Ans: Let Sn = total number of squares in an n − by − n square grid.
Observe that
n Sn
1 1
2 5=1+4
3 14=5+9
4 30=14+16
.. ..
. .

n 12 + 22 + 32 + · · · + n2 = Sn−1 + n2
The pattern that can be obtained is Sn = Sn−1 + n2
Claim. Sn = 12 + 22 + 32 + · · · + n2

Proof. • Basis Step. Let n = 1.The statement S1 = 1 is certainly true.

• Induction Step. Assume that the statement Sk = 12 + 22 + 32 + · · · + k2 is true for all natural numbers k ≥ n
Now, we need to show that Sk+1 = 12 + 22 + 32 + · · · + k2 + (k + 1)2 .

Sk+1 = Sk + (k + 1)2
= 12 + 22 + 32 + · · · + k2 + (k + 1)2

We have verified that Sk+1 is true for all natural numbers k ≥ n. Therefore, by the principle of mathematical induction,
total number of squares in an n − by − n square grid is given by 12 + 22 + 32 + · · · + n2

7. Prove: ∀xp(x) ∨ ∀xq(x) ⇒ ∀x(p(x) ∨ q(x)). Does the converse also hold?
Ans: Proof. Suppose ∀xp(x) ∨ ∀xq(x). WLOG, for any substitution a ∈ U , p(a). Then for any substitution a ∈ U ,
p(a) ∨ q(a). Hence, ∀x(p(x) ∨ q(x)).
For the converse, we can think of two statements that are true exclusively, i.e., one statement is true while the other
statement is false for some x. Take p(x) as the open statement, x is even, and q(x) as the open statement, x is odd. Note
that for all x, either x is even or odd, but not all x is even and not all x is odd.

END OF REVIEWER
kbramos7, kpraposas
LRC Math 29 1st Semester A.Y. 2021-2022