Xavier D.

Domingo
Math – 29 – D1

1.) Prove using direct proof. If n − 2 is even, then 6n − 5 is odd.

Direct proof: P ⟹ Q
Suppose n – 2 is even
NTS: 6n – 5 is odd
6n – 5 = 2 j + 1

n–2=2k
n=4k

6n – 5 = 6 (4 k) – 5 = 24 k – 5
2 (12 k – 3) + 1
2 j + 1 for some integer j = 12 k - 3

2.) Prove by contraposition. If the integer x + y is even, and x is odd then y is odd.
Proof by contraposition: (¬Q ⟹ ¬P)

Assume: If the integer x + y is even and x is odd then y is even.

NTS: x + y is odd

x is odd, let x = 2 k+ 1 (k ∈ Z)
y is even, let y = 2 t (t ∈ Z)

x + y = (2 k + 1) + (2 t) = 2(k + t) + 1
then x + y is odd ⟹ incorrect

So the assumption does not hold so if the integer x + y is even, and x is odd then y
is odd.
 Xavier D. Domingo
Math – 29 – D1

3.) Prove by contradiction. If the integer x + y is odd, then x is odd or y is odd.

Proof by contradiction: ( P ^ ¬ Q) ⟹ O

Suppose: x + y = 2 m + 1, but x = 2 k and y = 2 j

2 m + 1 = (2k) + (2j)
2 m + 1 = 2 (k + j)

odd = even
contradiction
Therefore x + y is even

4.) Prove by cases: (Triangle Inequality) For any real numbers a and b,
|a + b| ≤ |a| + |b|.

For all x ∈ R, we define the absolutely value | · | by

𝑥 𝑥>0
|x| = {
−𝑥 𝑥 ≤0

First, we note that for all x ∈ R,

(1) x ≤ |x|.
To verify this, we need to check two cases. If x > 0, then x ≤ |x|. If x ≤ 0, then x ≤ 0
≤ |x|. Similarly, by applying the inequality (1) to −x, we obtain −x ≤ |x|
as well. (Here, we have used that |x| = | − x|.) Now, let us use the inequality
(1) to solve the problem. To analyze |x+y|, we must take away the absolute value.
We will need to use cases. If x+y > 0, then

(2) |x + y| = x + y ≤ |x| + |y|.

On the other hand, if x + y ≤ 0, then
(3) |x + y| = −(x + y) = −x − y ≤ |x| + |y|.
 Xavier D. Domingo
Math – 29 – D1

5.) If x ≤ y and u ≤ v, then x + u ≤ y + v.

( P ^ ¬ Q) ⟹ O

Suppose x ≤ y and u ≤ v and then x + u > y + v

NTS: x + u > y + v
Since (1) 𝑥 ≤ 𝑦, 𝑥 + 𝑢 ≤ 𝑦 + 𝑢
Since (2) 𝑢 ≤ 𝑣, 𝑦 + 𝑢 ≤ 𝑦 + 𝑣

Combining (1) and (2)

𝑥+𝑢 ≤𝑦+𝑢 ≤𝑦+𝑣

We can see that by transitivity x + u ≤ y + v which is a contradiction to

x+u>y+v

Therefore, we get a contradiction

Hence x + u ≤ y + v
 Xavier D. Domingo
Math – 29 – D1

6.) Prove the following statement:

If x < 0, y < 0, and x < y, then y 2 < x 2 .

WLOG,
If 𝑥 < 0, 𝑦 < 0, then we can write
𝑥 = −𝑎 and 𝑦 = −𝑏
Where a and b are positive numbers
Also, if 𝑥 < 𝑦, then −𝑎 < −𝑏

Take −𝑎 to the right (becomes +)

Take −𝑏 to the left (becomes +)
⟹𝑏<𝑎

Substitute 𝑎 = −𝑥 and 𝑏 = −𝑦
⟹ −𝑦 < −𝑥
Square both sides (−𝑦)2 < (−𝑥)2
so, 𝑦 2 < 𝑥 2
 Xavier D. Domingo
Math – 29 – D1

7.) Show that √2 is irrational.

(def. #1) Any rational number x can be written in the form x = p/q, where p ∈ Z, q
∈ N. q ≠ 0, and at least one of p and q is odd.
(def. #2) Let n be an integer. Then 𝑛2 is even if and only if n is even.
• We argue by contradiction and suppose that the statement is false, that is √𝟐 not
irrational.
• Then √𝟐 is rational. By the definition of rational numbers, this means that √𝟐 can
be written as 2 = p/q, where p and q are integers with q ≠ 0. By (def. #1) we can
further assume that at least one of p and q is odd.
• Squaring each side of √𝟐= p/q and clearing denominators, we get
𝒑 𝟐 𝒑𝟐
𝟐 = ( ) = 𝟐 , 𝟐𝒒𝟐 = 𝒑𝟐
𝒒 𝒒
2
• Thus 𝑝 is 2 times an integer, and hence must be even, by the definition of an
even integer.
• By (def. #2) it follows that p must be even as well.
• Hence p = 2k, for some k ∈ Z, by the definition of an even integer.
• Substituting this into (1) gives

𝟐𝒒𝟐 = (𝟐𝒌)𝟐
𝒒𝟐 = 𝟐𝒌𝟐
• Thus 𝑞 2 is 2 times an integer, and hence must be even, by the definition of an
even integer.
• Therefore, both p and q must be even. This is a contradiction to (def. #1).
• Hence our assumption that √ 2 is rational was false.
• Therefore √ 2 must be irrational.
Xavier D. Domingo
Math – 29 – D1