Question:

 Let \( R \) be a relation on \( \mathbb{Z} \times \mathbb{Z} \) defined by \((a, b) R (c, d)\) if and only if \(ad - bc\) is divisible by 5.
Then \( R \) is:

Updated On: Nov 12, 2024
  • Reflexive but neither symmetric nor transitive
  • Reflexive and symmetric but not transitive
  • Reflexive, symmetric and transitive
  • Reflexive and transitive but not symmetric
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

Reflexive : for \((a, b) R (a, b) \)
\( ⇒ ab – ab = 0\) is divisible by 5.  
So \((a, b) R(a, b) ∀ a, b ∈ Z  \)
∴ R is reflexive  Symmetric : For \((a, b) R(c, d)  \)
If \(ad – bc\) is divisible by 5.  
Then \(bc – ad\) is also divisible by 5. 
\(⇒ (c, d) R(a, b) ∀ a, b, c, d ∈ Z  \)
∴ R is symmetric Transitive : If \((a, b) R(c, d) \) 
\(⇒ ad – bc\) divisible by 5 and \((c, d) R (e, f) \)
\(⇒ cf – de\) divisible by 5 
\(ad – bc = 5k_1\)   \( k_1\) and \(k_2\) are integers  
\(cf – de = 5k_2\) 
 \(afd – bcf = 5k_1f  \)
\(bcf – bde = 5k_2b  \)
\(afd – bde = 5(k_1f + k_2b)  \)
\(d(af – be) = 5 (k_1f + k_2b) \) 
\(⇒ af – be\) is not divisible by 5 for every a, b, c, d, e, f ∈ Z. 
\( ∴\) R is not transitive  
For e.g., take \(a = 1, b = 2, c = 5, d = 5, e = 2, f = 2\)

The correct option is (B): Reflexive and symmetric but not transitive

Was this answer helpful?
5
15

Questions Asked in JEE Main exam

View More Questions

Concepts Used:

Relations

A relation in mathematics defines the relationship between two different sets of information. If two sets are considered, the relation between them will be established if there is a connection between the elements of two or more non-empty sets. Therefore, we can say, ‘A set of ordered pairs is defined as a relation.’

Read Also: Relation and Function

Types of Relations:

There are 8 main types of relations which are:

  1. Empty Relation - An empty relation is one in which there is no relation between any elements of a set.
  2. Universal Relation - A universal is a type of relation in which every element of a set is related to each other. Now one of the universal relations will be R = {x, y} where, |x – y| ≥ 0. For universal relation, R = A × A
  3. Identity Relation - In an identity relation, every element of a set is related to itself only. For example, in a set A = {a, b, c}, the identity relation will be I = {a, a}, {b, b}, {c, c}.
  4. Inverse Relation - It is seen when a set has elements which are inverse pairs of another set. For example if set A = {(a, b), (c, d)}, then inverse relation will be R-1 = {(b, a), (d, c)}.
  5. Reflexive Relation - If every element of set A maps for itself, then set A is known as a reflexive relation.It is represented as a∈ A, (a,a) ∈ R.
  6. Symmetric Relation - A relation R on a set A is known as asymmetric relation if (a, b) ∈R then (b, a) ∈R , such that for all a and b ∈A.
  7. Transitive Relation - For transitive relation, if (x, y) ∈ R, (y, z) ∈ R, then (x, z) ∈ R. For a transitive relation, aRb and bRc ⇒ aRc ∀ a, b, c ∈ A
  8. Equivalence Relation - If a relation is reflexive, symmetric and transitive at the same time it is known as an equivalence relation.

Representation of Relations:

There are two ways by which a relation can be represented-

  1. Roster method
  2. Set-builder method

The roster form and set-builder for for a set integers lying between -2 and 3 will be-

Roster form

I= {-1,0,1,2}

Set-builder form

I= {x:x∈I,-2<x<3}