Let A=\1, 2, 3, 4\ and R=\(1, 2), (2, 3), (1, 4)\ be a relation on A. Let S be the equivalence relation on A such that R S and the number of elements in S is n. Then, the minimum value of n is .
Answer
16
Solution
S is symmetric and transitive: 1 2, 2 3, 1 4 ⇒ 1, 2, 3, 4 all lie in one equivalence class
every pair (x, y) with x, y A must be in S ⇒ S=A A
minimum n=4 4=16
Answer: 16