Proof and relation:

Prajit Adhikari

October 25, 2022

Problem 1:
Solution:
Theorem: For any three consecutive integers 𝑛, 53𝑛 + 24 cannot be a perfect square.
Proof: Suppose for the sake of contradiction assume that 53𝑛 + 24 can be a perfect square
for Let, n be an integer, and the three consecutive integers be 𝑛, 𝑛 + 1, 𝑛 + 2. Now, for some
integers, 𝑥, 𝑦, 𝑧, let,

𝑥 2 = 53𝑛 + 24, 𝑦 2 = 53(𝑛 + 1) + 24, 𝑧 2 = 53(𝑛 + 2) + 24.

Now,
𝑦 2 − 𝑥 2 = 53, 𝑧 2 − 𝑦 2 = 53.
Since, 53 is a prime,
(𝑦 − 𝑥)(𝑦 + 𝑥) = 53 ⋅ 1.
(𝑧 − 𝑦)(𝑧 + 𝑦) = 53 ⋅ 1.
Solving both, we get,
𝑦 = 27, 𝑥 = 26.
𝑧 = 27, 𝑦 = 26.
However, we have 𝑦 = 26 and 𝑦 = 27 which cannot be true. Contradiction.
Therefore, for any three consecutive integers 𝑛, 53𝑛 + 24 cannot be a perfect square.

1
Problem 2:
Solution:
Given: A relation ⋆ is defined on ℝ − {0} by 𝑥 ⋆ 𝑦 if and only if 𝑥𝑦 > 0.
a). Reflexive:
For any 𝑥 ∈ ℝ − {0} , 𝑥 2 > 0 since the square of a real number is always greater than or equal
to 0. So, ⋆ is reflexive.

b). Symmetric:
Suppose 𝑥 ⋆ 𝑦, then we have 𝑥𝑦 > 0, then by the commutative property of multiplication
𝑦𝑥 > 0 which implies that 𝑦 ⋆ 𝑥. So, the relation is symmetric.
c). Antisymmetric:
For any 𝑥, 𝑦 ∈ ℝ − {0}, 𝑥 ⋆ 𝑦 if and only if 𝑥𝑦 > 0, if 𝑥𝑦 > 0, then so 𝑦𝑥 > 0, and 𝑦 may or may
not be equal to 𝑥. Hence, the relation is not antisymmetric.
d). Transitive:
For any 𝑥, 𝑦, 𝑧 ∈ ℝ − {0}, let 𝑥 ⋆ 𝑦 and 𝑦 ⋆ 𝑧, then we have,

𝑥𝑦 > 0, 𝑦𝑧 > 0.

Now, if 𝑥𝑦 > 0, then 𝑥 and 𝑦 have the same sign and similarly with 𝑦 and 𝑧, which implies
that 𝑥 and 𝑧 also have the same sign. Hence, the relation is transitive.
e). Since, ⋆ is reflexive, symmetric, and transitive, it is an equivalence relation.

2
Problem 3:
Solution:
a. To prove: If 𝑔o𝑓 is surjective, then 𝑓 is surjective.
False.
Proof: Since 𝑓 is in the domain of function 𝑔 here, and given that mapping 𝑆− > 𝑇 − > 𝑈 is
surjective and since 𝑔 is a well-defined function, ∃𝑥 ∈ 𝑆 such that (𝑔𝑜𝑓 )(𝑥) = 𝑦, however, if we
have multiple values from 𝑇 that map to 𝑈 , but at least one of the element of the multiple
mapping do not have pre image in 𝑆, then the mapping is still valid, so 𝑓 is not always surjective.

b. . To prove: If 𝑔o𝑓 is injective, then 𝑓 is injective.

True.
Proof: Suppose that for 𝑎, 𝑏 ∈ 𝑆, we have 𝑓 (𝑎) = 𝑓 (𝑏), and it is given that 𝑔𝑜𝑓 is injective. So,
for 𝑓 (𝑎) = 𝑓 (𝑏), we have,

(𝑔𝑜𝑓 )(𝑎) = 𝑔(𝑓 (𝑎)) = 𝑔(𝑓 (𝑏)) = (𝑔𝑜𝑓 )(𝑏).

which implies that 𝑎 = 𝑏, since 𝑔𝑜𝑓 is injective. Hence, 𝑓 (𝑎) = 𝑓 (𝑏) implies 𝑎 = 𝑏, which proves
that 𝑓 is injective.

c.To prove: If 𝑔o𝑓 is injective and 𝑓 is surjective, then 𝑔 is injective.

False.
Proof: Since 𝑓 is surjective, ∀𝑥 ∈ 𝑇 , 𝑥 has a pre-image in 𝑆, and 𝑓 is also injective from
(b). So, 𝑓 is bijective, now them 𝑇 must also have injective mapping to 𝑈 . For instance con-
sider, 𝑓 (𝑎) = 𝑓 (𝑏) for some 𝑎, 𝑏 ∈ 𝑆, then, we have 𝑎 = 𝑏, and similarly, 𝑔(𝑓 (𝑎)) = 𝑔(𝑓 (𝑏)), i.e.
(𝑔𝑜𝑓 )(𝑎) = (𝑔𝑜𝑓 )(𝑏), ans since 𝑎 = 𝑏,we have, 𝑔 is an injective function.