Let A = {1, 2, 3, 4, 6}. Let R be the relation on A defined by R = {(a, b) : a, b ∈ A, b is exactly divisible by a}.<br>(i) Write R in roster form.<br>(ii) Find the domain and range of R.<br>(iii) Is R an equivalence relation? Give reason.
▶ Show Detailed Solution
(i) b is divisible by a (a divides b):
1 divides all: (1,1),(1,2),(1,3),(1,4),(1,6)
2 divides: 2,4,6 → (2,2),(2,4),(2,6)
3 divides: 3,6 → (3,3),(3,6)
4 divides: 4 → (4,4)
6 divides: 6 → (6,6)
R = {(1,1),(1,2),(1,3),(1,4),(1,6),(2,2),(2,4),(2,6),(3,3),(3,6),(4,4),(6,6)}
(ii) Domain = {1, 2, 3, 4, 6}, Range = {1, 2, 3, 4, 6}
(iii) Not symmetric: (1,2) ∈ R but (2,1) ∉ R. Hence R is NOT an equivalence relation (equivalence requires reflexivity, symmetry, transitivity).