Question:

The relation $R =\{(a, b)$ : $\operatorname{gcd}(a, b)=1,2 a \neq b, a, b \in Z\}$ is :

Updated On: May 8, 2025
  • reflexive but not symmetric
  • transitive but not reflexive
  • symmetric but not transitive
  • neither symmetric nor transitive
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is D

Approach Solution - 1

Reflexive: 
\((a,a) ⇒ gcd \space of (a,a)=1\)
Which is not true for every \(a ϵ Z.\)

Symmetric:
Take \(a=2, b=1⇒gcd(2,1)=1\)
Also \(2a=4\neq b\) 
Now when  \(a=1,b=2⇒gcd(1,2)=1\)
Also now  \(2a=2=b\) 
Hence \(a=2b\)
\(⇒\) R is not Symmetric

Transitive: 
Let \(a=14,b=19,c=21\)
gcd \((a,b)=1\)
gcd \((b,c)=1\)
gcd \((a,c)=7\)
Hence not transitive

\(⇒\)The correct option is (D): R is neither symmetric nor transitive.

Was this answer helpful?
13
8
Hide Solution
collegedunia
Verified By Collegedunia

Approach Solution -2

Reflexive: For \( (a, a) \): \[ \gcd(a, a) = a, \] which is not equal to 1 for all \( a \). Hence, \( R \) is not reflexive. \vspace{0.2cm}
Symmetric: If \( (a, b) \in R \), then \( \gcd(a, b) = 1 \) and \( 2a \leq b \). However, for \( (b, a) \): \[ \gcd(b, a) = 1 \text{ is true, but } 2b \leq a \text{ may not hold}. \] Hence, \( R \) is not symmetric. \vspace{0.2cm} 
Transitive: Consider \( a = 14, b = 19, c = 21 \): \[ \gcd(14, 19) = 1, \quad \gcd(19, 21) = 1, \quad \gcd(14, 21) = 7. \] Thus, \( R \) is not transitive. 
Conclusion: \( R \) is neither symmetric nor transitive.

Was this answer helpful?
1
1

Concepts Used:

Relations and functions

A relation R from a non-empty set B is a subset of the cartesian product A × B. The subset is derived by describing a relationship between the first element and the second element of the ordered pairs in A × B.

A relation f from a set A to a set B is said to be a function if every element of set A has one and only one image in set B. In other words, no two distinct elements of B have the same pre-image.

Representation of Relation and Function

Relations and functions can be represented in different forms such as arrow representation, algebraic form, set-builder form, graphically, roster form, and tabular form. Define a function f: A = {1, 2, 3} → B = {1, 4, 9} such that f(1) = 1, f(2) = 4, f(3) = 9. Now, represent this function in different forms.

  1. Set-builder form - {(x, y): f(x) = y2, x ∈ A, y ∈ B}
  2. Roster form - {(1, 1), (2, 4), (3, 9)}
  3. Arrow Representation