Math1081

Written by TRUNG-HIEU-TRINH (z5426330)

Written date 29/06/2023
1. Prove that log 72 54 is irrational.
Solution:
In order to prove that log 72 54 is irrational, we can make an opposite assumption and confirm that it is
incompatible.
Assuming log 72 54 is rational, we have:
𝑥
log 72 54 = .
𝑦

Where x and y are integers with 1 as the only common factor. x and y are coprime. (y ≠ 0).
Rewriting the equation above, we have:
𝑥
72𝑦 = 54.
Raise two sides by the power of y, we have:
72𝑥 = 54𝑦 .

Because 72 = 23 × 32 and 54 = 33 × 2, we have:

(23 × 32 )𝑥 = (33 × 2)𝑦 .

Simplify, we have:

23𝑥 × 32𝑥 = 33𝑦 × 2𝑦 .

Both sides have two prime factors of 2 and 3 but the powers are different.
Comparing the power of 2, 3x and 2y can’t be the same cause they are coprime.
Comparing the power of 3, 2x and y can’ be the same cause they are also coprime.

Because 3x ≠ 2y and 2x ≠ y, we have

23𝑥 × 32𝑥 ≠ 33𝑦 × 2𝑦
And,
𝑥
log 72 54 ≠ .
𝑦

Since log 72 54 can’t be expressed by the ratio of two integers, log 72 54 is irrational.
 2. A relation ⋆ is defined on ℤ2 by
(𝑥1, 𝑥2) ⋆ (y1, y2) if and only if 𝑥1 + 𝑦2 = 𝑥2 + 𝑦1.

For each of the following questions, be sure to provide a proof supporting your answer.
a) Is ⋆ reflexive?
b) Is ⋆ symmetric?

c) Is ⋆ anti-symmetric?
d) Is ⋆ transitive?
e) Is ⋆ an equivalence relation, a partial order, both, or neither?

Solution:

a) To prove that ⋆ is reflexive, we need to prove that for every element of (𝑥1, 𝑥2) ∈ ℤ2 ,
(𝑥1, 𝑥2) must relate to itself.

Since 𝑥1 + 𝑥2 = 𝑥2 + 𝑥1 by commutative property of addition, ⋆ is reflexive.

b) To prove that ⋆ symmetric. For every element of (𝑥1, 𝑥2) and (𝑦1, 𝑦2) ∈ ℤ2
(𝑥1, 𝑥2) must relate to (𝑦1, 𝑦2) and vice versa.

Assume that (𝑥1, 𝑥2) relate to (𝑦1, 𝑦2), we have 𝑥1 + 𝑦2 = 𝑥2 + 𝑦1. Because
y1 + x2 = x1 + y2 by the commutative property of addition, ⋆ is symmetric.

c) To prove that ⋆ is anti-symmetric. For every distinct element of (𝑥1, 𝑥2), (𝑦1, 𝑦2) ∈ ℤ2 .
Assuming (𝑥1, 𝑥2) relate to (𝑦1, 𝑦2), and (𝑦1, 𝑦2) relate to (𝑥1, 𝑥2).
The condition (𝑥1, 𝑥2) = (𝑦1, 𝑦2) must sastified.

Assume that (𝑥1, 𝑥2) relate to (𝑦1, 𝑦2), and (𝑦1, 𝑦2) relate to (𝑥1, 𝑥2), we have
x1 + y2 = x2 + y1,
y1 + x2 = y2 + x1.
Rearrange both equations, we have
𝑥1 − 𝑥2 = 𝑦1 − 𝑦2,
𝑦1 − 𝑦2 = 𝑥1 − 𝑥2.
Since 𝑥1 − 𝑥2 = 𝑦1 − 𝑦2, and 𝑦1 − 𝑦2 = 𝑥1 − 𝑥2. We have
𝑥1 − 𝑥2 = 𝑥1 − 𝑥2,

𝑦1 − 𝑦2 = 𝑦1 − 𝑦2.
Simplify, we have:
 0=0,
0=0.
Since 0=0 is true by the reflexive property of equality, (𝑥1, 𝑥2) = (𝑦1, 𝑦2) is true and ⋆ is anti-
symmetric.

d) To prove that ⋆ is transitive, For (𝑥1, 𝑥2), (𝑦1, 𝑦2), (𝑧1, 𝑧2) ∈ ℤ2 . If
(𝑥1, 𝑥2) relate to (𝑦1, 𝑦2) and (𝑦1, 𝑦2) relate to (𝑧1, 𝑧2) then (𝑥1, 𝑥2) relate to (𝑧1, 𝑧2).

Assume that (𝑥1, 𝑥2) relate to (𝑦1, 𝑦2) and (𝑦1, 𝑦2) relate to (𝑧1, 𝑧2), we have
𝑥1 + 𝑦2 = 𝑦1 + 𝑥2,
𝑦1 + 𝑧2 = 𝑦2 + 𝑧1.
We have

𝑥1 + 𝑦2 + (𝑦1 + 𝑧2) = 𝑦1 + 𝑥2 + (𝑦1 + 𝑧2).

Since,
𝑦1 + 𝑧2 = 𝑦2 + 𝑧1.
We have
𝑥1 + 𝑧2 + 𝑦1 + 𝑦2 = 𝑦1 + 𝑦2 + 𝑥2 + 𝑧1.

Subtract 𝑦1 + 𝑦2 in both sides, we have

𝑥1 + 𝑧2 = 𝑥2 + 𝑧1.
Because 𝑥1 + 𝑧2 = 𝑥2 + 𝑧1, ⋆ is transitive.

e) Because ⋆ is reflexive, symmetric, anti-symmetric, and transitive, ⋆ is an equivalence

relation and a partial order.