Practicing Success
Let R be the relation on N (set of Natural numbers) defined by R= {(a, b): a, b ∈ N and b is divisible by a}. Then the relation R is |
Reflexive, symmetric but not Transitive. Reflexive, Transitive but not symmetric. Not Reflexive, not transitive, not symmetric. Equivalence relation |
Reflexive, Transitive but not symmetric. |
for every $n ∈ N$ $(n,n)∈R$ (as n is always divisible by itself) ⇒ Reflexive eg: $(2, 4)∈R$ as 4 is divisible by 2 but $(4,2)∉R$ as 2 is not divisible by 4 ⇒ Not symmetric for $(a,b)∈R,(b,c)∈R$ as c is divisible by b and b is further divisible by a ⇒ c is divisible by a $(a,c)∈R$ ⇒ Transitive |