SOLVER7 Study. Nothing Else.
2026 Board Paper Q26(b)

Let \(n\) be a fixed positive integer. A relation \(R\) is defined in set \(Z\) such that \(R=\{(x,y):(x-y)\) is divisible by \(n,\ x,y\in Z\}\). Determine if \(R\) is an equivalence relation.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine you sort all whole numbers into groups where every two numbers in the same group have a difference that a chosen number divides evenly. Numbers in the same group always pair with themselves, always pair back the other way, and always connect through a third member. Think of it like friends sharing the same locker row — every student belongs to their own row, the friendship goes both ways, and connected students stay connected through a common friend. Because these three friendly rules always hold, this sorting rule is called an equivalence relation.

Answer: The relation \( R = \{(x,y) : (x-y) \text{ is divisible by } n\} \) is reflexive, symmetric, and transitive on \( Z \). Therefore \( R \) is an equivalence relation.

📖 Congruence Relation Modulo n is an Equivalence Relation

Detailed Explanation

A relation \( R \) on a set is called an equivalence relation if it satisfies three properties: reflexive (every element is related to itself), symmetric (if \( x \) is related to \( y \), then \( y \) is related to \( x \)), and transitive (if \( x \) is related to \( y \) and \( y \) is related to \( z \), then \( x \) is related to \( z \)). Here the relation is defined on the set of integers \( Z \) by \( R = \{(x,y) : (x-y) \text{ is divisible by } n\} \). Saying that \( (x-y) \) is divisible by \( n \) means \( x - y = nk \) for some integer \( k \). To prove \( R \) is an equivalence relation, we verify all three properties one by one using this idea.

Formula Used

\( (x,y) \in R \iff x - y = nk \) for some integer \( k \), i.e. \( n \mid (x-y) \).

Solution

  1. Step 1: Check Reflexivity: We must show \( (x,x) \in R \) for every \( x \in Z \). Consider \( x - x = 0 \). Since \( 0 = n \cdot 0 \), the number \( 0 \) is divisible by \( n \). Therefore \( (x-x) \) is divisible by \( n \), which means \( (x,x) \in R \). So \( R \) is reflexive.
  2. Step 2: Check Symmetry: Assume \( (x,y) \in R \). Then \( (x-y) \) is divisible by \( n \), so \( x - y = nk \) for some integer \( k \). Now look at \( y - x \). We have \( y - x = -(x-y) = -nk = n(-k) \). Since \( -k \) is also an integer, \( (y-x) \) is divisible by \( n \), so \( (y,x) \in R \). Hence \( R \) is symmetric.
  3. Step 3: Check Transitivity: Assume \( (x,y) \in R \) and \( (y,z) \in R \). Then \( x - y = nk_1 \) and \( y - z = nk_2 \) for some integers \( k_1 \) and \( k_2 \). Adding these gives \( (x-y) + (y-z) = nk_1 + nk_2 \), which simplifies to \( x - z = n(k_1 + k_2) \). Since \( k_1 + k_2 \) is an integer, \( (x-z) \) is divisible by \( n \), so \( (x,z) \in R \). Hence \( R \) is transitive.
  4. Step 4: Conclusion: Since \( R \) is reflexive, symmetric, and transitive, all three conditions of an equivalence relation are satisfied.

Final Answer

The relation \( R = \{(x,y) : (x-y) \text{ is divisible by } n\} \) is reflexive, symmetric, and transitive on \( Z \). Therefore \( R \) is an equivalence relation.

Common Mistake

A common mistake is proving symmetry incorrectly by claiming \( y - x \) is divisible by \( n \) without justification. You must show \( y - x = -(x-y) = n(-k) \), so that the divisibility clearly carries over. Simply writing 'obviously symmetric' loses marks.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Understand the relation: The relation is defined on the set of integers \( Z \) as \( R = \{(x, y) : n \mid (x - y)\} \). This means a pair \( (x, y) \) belongs to \( R \) whenever \( x - y \) is an exact multiple of \( n \), i.e., \( x - y = nk \) for some \( k \in Z \). — Reason: Translating divisibility into algebra makes each verification concrete and easy to manipulate.
  2. Step 2: Verify Reflexivity: Take any \( x \in Z \) and compute \( x - x = 0 \). Since \( 0 = n \cdot 0 \), we have \( n \mid 0 \), so \( (x, x) \in R \) for every integer \( x \). — Reason: Reflexivity requires every element to be related to itself; showing \( x - x \) is always divisible by \( n \) confirms this. Hence \( R \) is reflexive.
  3. Step 3: Verify Symmetry — Setup: Assume \( (x, y) \in R \). By the definition of \( R \), there exists an integer \( k \) such that \( x - y = nk \). — Reason: Symmetry demands that whenever \( x \) is related to \( y \), then \( y \) must also be related to \( x \), so we start by assuming the forward relation holds.
  4. Step 4: Verify Symmetry — Conclusion: From \( x - y = nk \), multiply both sides by \( -1 \) to get \( y - x = n(-k) \). Since \( -k \) is an integer (the integers are closed under negation), we conclude \( n \mid (y - x) \), so \( (y, x) \in R \). — Reason: Writing \( y - x \) as \( n(-k) \) directly shows it is a multiple of \( n \), proving the symmetric property. Hence \( R \) is symmetric.
  5. Step 5: Verify Transitivity — Setup: Assume both \( (x, y) \in R \) and \( (y, z) \in R \). Then there exist integers \( k_1 \) and \( k_2 \) such that \( x - y = nk_1 \) and \( y - z = nk_2 \). — Reason: Transitivity requires that two overlapping relations imply a third; capturing both assumptions in algebraic form prepares us to combine them.
  6. Step 6: Verify Transitivity — Conclusion: Add the two equations: \( (x - y) + (y - z) = nk_1 + nk_2 \). The left side simplifies to \( x - z \) and the right side becomes \( n(k_1 + k_2) \). Since \( k_1 + k_2 \) is an integer, we have \( n \mid (x - z) \), giving \( (x, z) \in R \). — Reason: Adding both equations elegantly cancels \( y \) and directly expresses \( x - z \) as a multiple of \( n \), completing the transitivity check. Hence \( R \) is transitive.
  7. Step 7: Combine all three results: We have shown: (i) \( R \) is reflexive, (ii) \( R \) is symmetric, and (iii) \( R \) is transitive. A relation satisfying all three properties simultaneously is, by definition, an equivalence relation. — Reason: All three conditions are necessary and together sufficient to conclude equivalence; none can be skipped.

Final Answer

The relation \( R = \{(x,y) : (x-y) \text{ is divisible by } n\} \) is reflexive, symmetric, and transitive on \( Z \). Therefore \( R \) is an equivalence relation.

Common Mistake

One common mistake: When verifying symmetry, students forget to check that \( -k \) is still an integer. Since the integers are closed under negation, \( -k \in Z \) automatically, but skipping this justification leads to an incomplete proof.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexivity: For any \( x \in Z \): \( x - x = 0 = n \cdot 0 \), so \( n \mid (x-x) \), thus \( (x,x) \in R \). \( R \) is reflexive.
  2. Symmetry: Let \( (x,y) \in R \). Then \( x - y = nk \) for some \( k \in Z \). So \( y - x = n(-k) \), and since \( -k \in Z \), we get \( (y,x) \in R \). \( R \) is symmetric.
  3. Transitivity: Let \( (x,y) \in R \) and \( (y,z) \in R \). Then \( x - y = nk_1 \) and \( y - z = nk_2 \) for \( k_1, k_2 \in Z \). Adding: \( x - z = n(k_1 + k_2) \), so \( (x,z) \in R \). \( R \) is transitive.

Answer: The relation \( R = \{(x,y) : (x-y) \text{ is divisible by } n\} \) is reflexive, symmetric, and transitive on \( Z \). Therefore \( R \) is an equivalence relation.

➕ More Examples

More Examples

Example 1

Question: Let m be a fixed positive integer. A relation R is defined on the set of integers \( \mathbb{Z} \) by \[ R = \{(a, b) : m \mid (a^2 - b^2),\ a, b \in \mathbb{Z}\} \] where \( m \mid (a^2 - b^2) \) means \( m \) divides \( (a^2 - b^2) \). Determine whether R is an equivalence relation.

Solution: We check all three properties of an equivalence relation. Reflexivity: Let \( a \in \mathbb{Z} \). Consider \( a^2 - a^2 = 0 \). Since \( m \mid 0 \) for any positive integer m, we have \( (a, a) \in R \) for all \( a \in \mathbb{Z} \). Hence R is reflexive. Symmetry: Let \( (a, b) \in R \). Then \( m \mid (a^2 - b^2) \). This means \( a^2 - b^2 = mk \) for some integer k. Therefore \( b^2 - a^2 = m(-k) \), and since \( -k \in \mathbb{Z} \), we get \( m \mid (b^2 - a^2) \). Hence \( (b, a) \in R \), so R is symmetric. Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then \( m \mid (a^2 - b^2) \) and \( m \mid (b^2 - c^2) \). So there exist integers \( k_1, k_2 \) such that \[ a^2 - b^2 = mk_1 \quad \text{and} \quad b^2 - c^2 = mk_2. \] Adding these two equations: \[ a^2 - c^2 = m(k_1 + k_2). \] Since \( k_1 + k_2 \in \mathbb{Z} \), we get \( m \mid (a^2 - c^2) \), so \( (a, c) \in R \). Hence R is transitive. 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 the set \( \mathbb{R} \) of real numbers as follows: \[ R = \{(x, y) : x - y \in \mathbb{Z},\ x, y \in \mathbb{R}\} \] where \( \mathbb{Z} \) denotes the set of all integers. Determine whether R is an equivalence relation.

Solution: We verify all three properties. Reflexivity: Let \( x \in \mathbb{R} \). Then \( x - x = 0 \in \mathbb{Z} \). So \( (x, x) \in R \) for all \( x \in \mathbb{R} \). Hence R is reflexive. Symmetry: Let \( (x, y) \in R \). Then \( x - y \in \mathbb{Z} \). Let \( x - y = k \) where \( k \in \mathbb{Z} \). Then \( y - x = -k \). Since \( -k \in \mathbb{Z} \), we have \( y - x \in \mathbb{Z} \), so \( (y, x) \in R \). Hence R is symmetric. Transitivity: Let \( (x, y) \in R \) and \( (y, z) \in R \). Then \( x - y \in \mathbb{Z} \) and \( y - z \in \mathbb{Z} \). Let \( x - y = k_1 \) and \( y - z = k_2 \) where \( k_1, k_2 \in \mathbb{Z} \). Adding: \[ x - z = (x - y) + (y - z) = k_1 + k_2. \] Since \( k_1 + k_2 \in \mathbb{Z} \), we have \( x - z \in \mathbb{Z} \), so \( (x, z) \in R \). Hence R is transitive. Since R satisfies all three properties, R is an equivalence relation on \( \mathbb{R} \). Note: The equivalence class of any \( x \in \mathbb{R} \) under this relation is \( [x] = \{x + k : k \in \mathbb{Z}\} \), i.e., all real numbers that differ from x by an integer.

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

🎯 Try a Similar Question

Try a Similar Question

Question: A relation \( R \) is defined on the set of integers \( \mathbb{Z} \) by \( R = \{(a, b) : 3 \mid (2a - 2b),\ a, b \in \mathbb{Z}\} \). Determine whether \( R \) is an equivalence relation. If it is, describe the equivalence classes.

Solution

  1. Step 1: Simplify the condition: The condition \( 3 \mid (2a - 2b) \) means \( 2a - 2b = 2(a - b) \) is divisible by 3. Since \( \gcd(2, 3) = 1 \), divisibility of \( 2(a-b) \) by 3 is equivalent to divisibility of \( (a - b) \) by 3. So \( R = \{(a, b) : 3 \mid (a - b),\ a, b \in \mathbb{Z}\} \).
  2. Step 2: Check Reflexivity: For any \( a \in \mathbb{Z} \), we check whether \( (a, a) \in R \). We have \( a - a = 0 \), and 3 divides 0. Therefore \( (a, a) \in R \) for all \( a \in \mathbb{Z} \), so \( R \) is reflexive.
  3. Step 3: Check Symmetry: Suppose \( (a, b) \in R \). Then \( 3 \mid (a - b) \), which means \( a - b = 3k \) for some integer \( k \). Then \( b - a = -3k = 3(-k) \), so \( 3 \mid (b - a) \). Therefore \( (b, a) \in R \), and \( R \) is symmetric.
  4. Step 4: Check Transitivity: Suppose \( (a, b) \in R \) and \( (b, c) \in R \). Then \( 3 \mid (a - b) \) and \( 3 \mid (b - c) \). So \( a - b = 3m \) and \( b - c = 3p \) for integers \( m \) and \( p \). Adding: \( a - c = (a - b) + (b - c) = 3m + 3p = 3(m + p) \), so \( 3 \mid (a - c) \). Therefore \( (a, c) \in R \), and \( R \) is transitive.
  5. Step 5: Conclusion and Equivalence Classes: Since \( R \) is reflexive, symmetric, and transitive, it is an equivalence relation on \( \mathbb{Z} \). The equivalence classes are the residue classes modulo 3: \( [0] = \{\ldots, -6, -3, 0, 3, 6, \ldots\} \), \( [1] = \{\ldots, -5, -2, 1, 4, 7, \ldots\} \), and \( [2] = \{\ldots, -4, -1, 2, 5, 8, \ldots\} \). These three classes partition \( \mathbb{Z} \).

Answer: The relation \( R = \{(a, b) : 3 \mid (2a - 2b)\} \) simplifies to \( 3 \mid (a - b) \) and is reflexive, symmetric, and transitive on \( \mathbb{Z} \). Therefore \( R \) is an equivalence relation, and it partitions \( \mathbb{Z} \) into exactly three equivalence classes: \( [0], [1], \) and \( [2] \) (the residue classes modulo 3).

Everything you get with Solver7

More questions in Relations and Functions