Question

Let RR be the relation on the set of positive integers such that aRbaRb if and only if aa and bb are distinct and have a common divisor other than 1. Which one of the following statements about RR is true?

Choose one option
Official answer and solution
Official answer
D
From
Official GATE 2015 answer key

Solution

Test the properties of reflexivity, symmetry, and transitivity on the defined relation RR.

By definition, aRbaRb if and only if:

  1. a≠ba \neq b (aa and bb are distinct), and
  2. gcd⁡(a,b)>1\gcd(a, b) > 1 (aa and bb share a common divisor other than 1).
  • Reflexivity: For any positive integer aa, aa is not distinct from itself (a=aa = a), so (a,a)∉R(a, a) \notin R. Thus, RR is not reflexive.
  • Symmetry: If aRbaRb, then a≠ba \neq b and gcd⁡(a,b)>1\gcd(a, b) > 1. Because distinctness and greatest common divisor are commutative (b≠ab \neq a and gcd⁡(b,a)=gcd⁡(a,b)>1\gcd(b, a) = \gcd(a, b) > 1), bRabRa holds. Thus, RR is symmetric.
  • Transitivity: Consider a=2,b=6,c=9a = 2, b = 6, c = 9:
    • a≠ba \neq b and gcd⁡(2,6)=2>1  ⟹  2R6\gcd(2, 6) = 2 > 1 \implies 2R6.
    • b≠cb \neq c and gcd⁡(6,9)=3>1  ⟹  6R9\gcd(6, 9) = 3 > 1 \implies 6R9.
    • However, gcd⁡(2,9)=1\gcd(2, 9) = 1, so (2,9)∉R(2, 9) \notin R.
      Hence, RR is not transitive.

Therefore, RR is symmetric, but neither reflexive nor transitive (option D).

Final answer

D

Common trap

Overlooking the condition that aa and bb must be distinct, which violates reflexivity for every element.

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper
GATE 2015 Computer Science and Information Technology (CS) Session 2
Question
26 of 65, printed as CS Q.16
Section
Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.