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
A body of mass 1000 kg is moving horizontally with a velocity of 6 m/s. If 200 kg extra mass is added, the final velocity (in m/s) is:
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
There are 8 main types of relations which are:
There are two ways by which a relation can be represented-
The roster form and set-builder for for a set integers lying between -2 and 3 will be-
I= {-1,0,1,2}
I= {x:x∈I,-2<x<3}