SOLVER7 Study. Nothing Else.
2026 Board Paper Q32(a)

A relation R is defined on Z, the set of integers, as \(R=\{(x, y) : |x – y| \) is divisible by a prime number \(‘p’, x, y \in Z\}\) check whether R is an equivalence relation or not.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine sorting all integers into groups based on a special rule involving a prime number \( p \). Two numbers belong together if their difference is a multiple of \( p \). Every number is in its own group because its difference with itself is zero. If number \( a \) belongs with \( b \), then \( b \) belongs with \( a \) too, just like two friends always recognise each other. Also, if \( a \) matches \( b \) and \( b \) matches \( c \), then \( a \) must match \( c \). These three friendly rules make the relation an equivalence relation.

Answer: The relation R is reflexive, symmetric, and transitive. Therefore R is an equivalence relation on \( Z \).

📖 Checking if R is an Equivalence Relation

Detailed Explanation

A relation \( R \) on a set is called an equivalence relation if it satisfies three properties: it must be reflexive (every element is related to itself), symmetric (if \( a \) is related to \( b \), then \( b \) is related to \( a \)), and transitive (if \( a \) is related to \( b \) and \( b \) is related to \( c \), then \( a \) is related to \( c \)). Here the relation is \( R = \{(x, y) : |x - y| \text{ is divisible by a prime } p,\ x, y \in Z\} \). We must test all three properties. A key idea is that if \( p \) divides \( |a| \) and \( p \) divides \( |b| \), then \( p \) divides their sum. We treat \( 0 \) as divisible by any prime since \( 0 = p \times 0 \).

Formula Used

R is an equivalence relation if it is: Reflexive: \( (x,x) \in R \) for all \( x \). Symmetric: \( (x,y) \in R \Rightarrow (y,x) \in R \). Transitive: \( (x,y) \in R \) and \( (y,z) \in R \Rightarrow (x,z) \in R \).

Solution

  1. Step 1: Check reflexivity. Take any \( x \in Z \). Then \( |x - x| = 0 \). Since \( 0 = p \times 0 \), the number \( 0 \) is divisible by the prime \( p \). Therefore \( (x, x) \in R \) for every integer \( x \), which means R is reflexive.
  2. Step 2: Check symmetry. Suppose \( (x, y) \in R \). Then \( |x - y| \) is divisible by \( p \). But we know that \( |x - y| = |y - x| \). So \( |y - x| \) is also divisible by \( p \), which gives \( (y, x) \in R \). Hence R is symmetric.
  3. Step 3: Check transitivity. Suppose \( (x, y) \in R \) and \( (y, z) \in R \). Then \( p \) divides \( |x - y| \) and \( p \) divides \( |y - z| \). This means \( p \) divides \( (x - y) \) and \( p \) divides \( (y - z) \). Adding these, \( p \) divides \( (x - y) + (y - z) = x - z \). Therefore \( p \) divides \( |x - z| \), so \( (x, z) \in R \). Hence R is transitive.
  4. Step 4: Conclusion. Since R is reflexive, symmetric, and transitive, R satisfies all three conditions required for an equivalence relation.

Final Answer

The relation R is reflexive, symmetric, and transitive. Therefore R is an equivalence relation on \( Z \).

Common Mistake

A common mistake is thinking R fails reflexivity because \( |x - x| = 0 \) and assuming \( 0 \) is not divisible by \( p \). In fact \( 0 \) is divisible by every prime since \( 0 = p \times 0 \), so R is indeed reflexive.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Understand the given relation. The relation is defined as \( R = \{(x, y) : |x - y| \text{ is divisible by a prime } p,\ x, y \in Z\} \). — Reason: Before testing any property, clearly identify what it means for two integers to be related; here, \( x \) and \( y \) are related whenever \( p \mid |x - y| \).
  2. Step 2: Check Reflexivity: Take any arbitrary \( x \in Z \). Compute \( |x - x| = 0 \). Since \( 0 = p \times 0 \), the prime \( p \) divides \( 0 \). Therefore \( (x, x) \in R \) for every integer \( x \), so R is reflexive. — Reason: Reflexivity requires every element to be related to itself; checking \( |x - x| \) directly tests this.
  3. Step 3: Check Symmetry: Assume \( (x, y) \in R \) for some \( x, y \in Z \). This means \( p \mid |x - y| \). Observe that \( |x - y| = |y - x| \), so \( p \mid |y - x| \) as well. Therefore \( (y, x) \in R \), and R is symmetric. — Reason: Symmetry requires that the relation works in both directions; the absolute value makes the roles of \( x \) and \( y \) interchangeable.
  4. Step 4: Set up for Transitivity: Assume \( (x, y) \in R \) and \( (y, z) \in R \) for some \( x, y, z \in Z \). Then \( p \mid |x - y| \) and \( p \mid |y - z| \). — Reason: To verify transitivity we start by writing out what both given memberships tell us about divisibility.
  5. Step 5: Complete the Transitivity Argument: Since \( p \mid |x - y| \) and \( p \mid |y - z| \), the prime \( p \) divides their sum \( |x - y| + |y - z| \). By the triangle inequality, \( |x - z| \le |x - y| + |y - z| \), and more precisely \( (x - z) = (x - y) + (y - z) \), so \( p \mid |x - z| \). Therefore \( (x, z) \in R \), and R is transitive. — Reason: If \( p \) divides each of two integers, it must divide their algebraic sum, which here equals \( x - z \), completing the transitivity check.
  6. Step 6: Conclude: All three properties — reflexivity, symmetry, and transitivity — have been verified for \( R \). — Reason: Only after confirming all three can we declare \( R \) an equivalence relation.

Final Answer

The relation R is reflexive, symmetric, and transitive. Therefore R is an equivalence relation on \( Z \).

Common Mistake

One common mistake: Students often forget to verify all three properties and stop after checking only reflexivity and symmetry, thereby missing the transitivity step which is essential for the conclusion.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexivity: For any \( x \in Z \): \( |x - x| = 0 = p \times 0 \), so \( p \mid 0 \). Thus \( (x, x) \in R \). R is reflexive.
  2. Symmetry: \( (x, y) \in R \Rightarrow p \mid |x - y| \). Since \( |x - y| = |y - x| \), we get \( p \mid |y - x| \Rightarrow (y, x) \in R \). R is symmetric.
  3. Transitivity: \( (x, y) \in R \) and \( (y, z) \in R \Rightarrow p \mid |x - y| \) and \( p \mid |y - z| \). Since \( |x - z| \le |x - y| + |y - z| \) and \( p \) divides both, \( p \mid (|x - y| + |y - z|) \Rightarrow p \mid |x - z| \Rightarrow (x, z) \in R \). R is transitive.

Answer: The relation R is reflexive, symmetric, and transitive. Therefore R is an equivalence relation on \( Z \).

➕ More Examples

More Examples

Example 1

Question: A relation R is defined on \( \mathbb{Z} \), the set of all integers, as \( R = \{(x, y) : x - y \text{ is an even integer}, \, x, y \in \mathbb{Z}\} \). Check whether R is an equivalence relation.

Solution: We check the three properties of an equivalence relation. Step 1 — Reflexivity: For any \( x \in \mathbb{Z} \), we compute \( x - x = 0 \). Since 0 is an even integer, \( (x, x) \in R \) for all \( x \in \mathbb{Z} \). Hence R is reflexive. Step 2 — Symmetry: Let \( (x, y) \in R \). Then \( x - y \) is an even integer, so \( x - y = 2k \) for some \( k \in \mathbb{Z} \). Now, \( y - x = -(x - y) = -2k = 2(-k) \). Since \( -k \in \mathbb{Z} \), \( y - x \) is also even. Therefore \( (y, x) \in R \). Hence R is symmetric. Step 3 — Transitivity: Let \( (x, y) \in R \) and \( (y, z) \in R \). Then \( x - y = 2m \) and \( y - z = 2n \) for some \( m, n \in \mathbb{Z} \). Adding these: \( x - z = (x - y) + (y - z) = 2m + 2n = 2(m + n) \). Since \( m + n \in \mathbb{Z} \), \( x - z \) is even, so \( (x, z) \in R \). Hence R is transitive. Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation on \( \mathbb{Z} \).

Answer: R is an equivalence relation on \( \mathbb{Z} \).

Example 2

Question: A relation R is defined on \( \mathbb{N} \), the set of natural numbers, as \( R = \{(a, b) : 3 \mid (a^2 - b^2), \, a, b \in \mathbb{N}\} \), where \( 3 \mid (a^2 - b^2) \) means 3 divides \( a^2 - b^2 \). Check whether R is an equivalence relation.

Solution: We check the three properties of an equivalence relation. Step 1 — Reflexivity: For any \( a \in \mathbb{N} \), \( a^2 - a^2 = 0 \). Since \( 3 \mid 0 \) (as \( 0 = 3 \times 0 \)), we have \( (a, a) \in R \). Hence R is reflexive. Step 2 — Symmetry: Let \( (a, b) \in R \). Then \( 3 \mid (a^2 - b^2) \), so \( a^2 - b^2 = 3k \) for some \( k \in \mathbb{Z} \). Now, \( b^2 - a^2 = -(a^2 - b^2) = -3k = 3(-k) \). Since \( -k \in \mathbb{Z} \), we get \( 3 \mid (b^2 - a^2) \), so \( (b, a) \in R \). Hence R is symmetric. Step 3 — Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then \( a^2 - b^2 = 3m \) and \( b^2 - c^2 = 3n \) for some \( m, n \in \mathbb{Z} \). Adding: \( a^2 - c^2 = (a^2 - b^2) + (b^2 - c^2) = 3m + 3n = 3(m + n) \). Since \( m + n \in \mathbb{Z} \), we get \( 3 \mid (a^2 - c^2) \), so \( (a, c) \in R \). Hence R is transitive. Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation on \( \mathbb{N} \).

Answer: R is an equivalence relation on \( \mathbb{N} \).

🎯 Try a Similar Question

Try a Similar Question

Question: A relation R is defined on the set of natural numbers \( \mathbb{N} \) as \( R = \{(a, b) : 3 \mid (a^2 - b^2),\; a, b \in \mathbb{N}\} \), where \( 3 \mid (a^2 - b^2) \) means 3 divides \( a^2 - b^2 \). Check whether R is an equivalence relation or not.

Solution

  1. Step 1: Check Reflexivity: We need to check whether \( (a, a) \in R \) for every \( a \in \mathbb{N} \). Consider \( a^2 - a^2 = 0 \). Since 3 divides 0 (as \( 0 = 3 \times 0 \)), we have \( 3 \mid (a^2 - a^2) \) for all \( a \in \mathbb{N} \). Hence \( (a, a) \in R \) for all \( a \in \mathbb{N} \), so R is reflexive.
  2. Step 2: Check Symmetry: Suppose \( (a, b) \in R \). Then \( 3 \mid (a^2 - b^2) \), which means \( a^2 - b^2 = 3k \) for some integer \( k \). Therefore \( b^2 - a^2 = -3k = 3(-k) \), so \( 3 \mid (b^2 - a^2) \). Hence \( (b, a) \in R \), and R is symmetric.
  3. Step 3: Check Transitivity: Suppose \( (a, b) \in R \) and \( (b, c) \in R \). Then \( 3 \mid (a^2 - b^2) \) and \( 3 \mid (b^2 - c^2) \). So \( a^2 - b^2 = 3m \) and \( b^2 - c^2 = 3n \) for some integers \( m, n \). Adding these: \[ a^2 - c^2 = (a^2 - b^2) + (b^2 - c^2) = 3m + 3n = 3(m + n). \] Since \( m + n \) is an integer, \( 3 \mid (a^2 - c^2) \), so \( (a, c) \in R \). Hence R is transitive.
  4. Step 4: Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation on \( \mathbb{N} \). Note that the equivalence classes are determined by the remainder when \( a^2 \) is divided by 3, which depends on whether \( a \) is divisible by 3 or not (since \( a^2 \bmod 3 \) is either 0 or 1).

Answer: R is reflexive, symmetric, and transitive. Therefore R is an equivalence relation on \( \mathbb{N} \). However, unlike the original relation (which holds for any prime p and partitions \( \mathbb{Z} \) into p classes), this relation partitions \( \mathbb{N} \) into exactly 2 equivalence classes: multiples of 3, and non-multiples of 3, because \( a^2 - b^2 \) is divisible by 3 if and only if \( a \) and \( b \) have the same residue class modulo 3 (residue 0 or residue 1/2).

Everything you get with Solver7

More questions in Relations and Functions