Solution
Related Formula
A relation is an equivalence relation if it is reflexive, symmetric, and transitive.
Core Logic
First, partition set A into equivalence classes modulo 3: Numbers of form 3K: 0, 3, 6, 9 4 elements Numbers of form 3K+1: 1, 4, 7 3 elements Numbers of form 3K+2: 2, 5, 8 3 elements
Any pair (x, y) inside the same group will have a difference |x - y| that is a multiple of 3. The total number of elements in the relation R is the sum of pairs possible from each group:
n(R) = 4 × 4 + 3 × 3 + 3 × 3 n(R) = 16 + 9 + 9 = 34Statement I claims n(R) = 36, so it is false.
Step 1: Check Statement II
Reflexive: |x-x| = 0, which is a multiple of 3. (True) Symmetric: If |x-y| is a multiple of 3, then |y-x| is also a multiple of 3. (True) Transitive: If (x-y) = 3λ and (y-z) = 3μ, then (x-z) = (x-y) + (y-z) = 3(λ + μ), which is a multiple of 3. (True) Thus, R is an equivalence relation. Statement II is true.
Pattern Recognition
Relations defined by divisibility of differences inherently form congruence classes. Size of relation = sum of squares of equivalence class sizes.
Chapter Mix
Class 11 Maths: Sets, Relations and Functions