SOLVER7 Study. Nothing Else.
2026 Board Paper Q36(iii)a

Two friends Ramesh and Divya have started playing Ludo at their house. While rolling the die, they observed each time, that the possible outcomes are \(\{1, 2, 3, 4, 5, 6\}.\) Let \(A\) be the set of players and \(B\) be the set of all possible outcomes, so \(A=\{Ramesh, Divya\}\) and \(B=\{1, 2, 3, 4, 5, 6\}.\)Based on the above information, answer the following questions : Let relation \(R : B\rightarrow B\) be defined as \(R=\{(x,y):y\) is divisible by \(x\}.\)
Check whether R in B is symmetric or transitive.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a set of numbers like a family. The relation R says: one number is related to another if it divides it evenly. So 2 is related to 6 because 6 divides by 2 perfectly. But 6 is not related to 2, because 2 does not divide by 6. That broken two-way friendship means R is not symmetric. However, if 2 divides 6 and 6 divides 6, then 2 also divides 6 — the chain always works, so R is transitive.

Answer: R is not symmetric (for example \( (2, 6) \in R \) but \( (6, 2) \notin R \)), and R is transitive (if \( x \) divides \( y \) and \( y \) divides \( z \), then \( x \) divides \( z \)).

📖 Checking Symmetry and Transitivity of R on B

Detailed Explanation

We are given the set \( B = \{1, 2, 3, 4, 5, 6\} \) and a relation \( R \) on \( B \) defined as \( R = \{(x, y) : y \text{ is divisible by } x\} \). This means the ordered pair \( (x, y) \) belongs to \( R \) only when \( x \) divides \( y \) exactly (leaving no remainder). To test the properties, recall two definitions. A relation is symmetric if whenever \( (x, y) \in R \), then \( (y, x) \in R \) as well. A relation is transitive if whenever \( (x, y) \in R \) and \( (y, z) \in R \), then \( (x, z) \in R \). To disprove a property we only need one counterexample, but to prove a property we must argue it holds in general.

Formula Used

Symmetric: \( (x, y) \in R \Rightarrow (y, x) \in R \). Transitive: \( (x, y) \in R \text{ and } (y, z) \in R \Rightarrow (x, z) \in R \).

Solution

  1. Step 1: Understand the relation. Here \( (x, y) \in R \) means \( x \) divides \( y \). For example \( (2, 6) \in R \) because \( 6 \) is divisible by \( 2 \), and \( (1, 5) \in R \) because every number is divisible by \( 1 \).
  2. Step 2: Check symmetry. We look for a pair \( (x, y) \in R \) whose reverse \( (y, x) \) is not in R. Take \( x = 2 \) and \( y = 6 \). Since \( 6 \) is divisible by \( 2 \), we have \( (2, 6) \in R \). But for the reverse pair, \( 2 \) is not divisible by \( 6 \), so \( (6, 2) \notin R \).
  3. Step 3: Conclude about symmetry. Since \( (2, 6) \in R \) but \( (6, 2) \notin R \), the condition for symmetry fails. Therefore R is not symmetric.
  4. Step 4: Check transitivity. Suppose \( (x, y) \in R \) and \( (y, z) \in R \). This means \( x \) divides \( y \) and \( y \) divides \( z \). We can write \( y = x \cdot k \) and \( z = y \cdot m \) for some positive integers \( k \) and \( m \).
  5. Step 5: Substitute to test whether \( x \) divides \( z \). We get \[ z = y \cdot m = (x \cdot k) \cdot m = x \cdot (k m). \] Since \( k m \) is an integer, \( x \) divides \( z \), which means \( (x, z) \in R \).
  6. Step 6: Confirm with an example. Take \( (2, 4) \in R \) since \( 4 \) is divisible by \( 2 \), and \( (4, 4) \in R \). Then \( (2, 4) \in R \), so the chain gives \( (2, 4) \in R \), consistent with the general argument. Hence R is transitive.

Final Answer

R is not symmetric (for example \( (2, 6) \in R \) but \( (6, 2) \notin R \)), and R is transitive (if \( x \) divides \( y \) and \( y \) divides \( z \), then \( x \) divides \( z \)).

Common Mistake

A common mistake is assuming that because \( (1, y) \in R \) for all \( y \), the relation is symmetric. Symmetry requires the reverse of every pair to hold; a single counterexample like \( (2, 6) \in R \) with \( (6, 2) \notin R \) is enough to conclude R is not symmetric.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Interpret the relation \( R \). The pair \( (x, y) \) belongs to \( R \) if and only if \( x \) divides \( y \) exactly (with zero remainder), where both \( x \) and \( y \) are elements of \( B = \{1, 2, 3, 4, 5, 6\} \). For instance, \( (2, 6) \in R \) because \( 2 \) divides \( 6 \), and \( (1, 5) \in R \) because \( 1 \) divides every integer. — Reason: Clearly understanding what membership in \( R \) means is essential before testing any property.
  2. Step 2: Recall the definition of symmetry: \( R \) is symmetric if for every pair \( (x, y) \in R \), the reversed pair \( (y, x) \) is also in \( R \). To disprove symmetry, we only need a single counterexample where \( (x, y) \in R \) but \( (y, x) \notin R \). — Reason: A single counterexample is sufficient to show that a property fails for the entire relation.
  3. Step 3: Choose \( x = 2 \) and \( y = 6 \). Since \( 2 \) divides \( 6 \), we have \( (2, 6) \in R \). Now check the reverse: does \( 6 \) divide \( 2 \)? No, because \( 2 < 6 \) and \( 6 \) cannot divide \( 2 \) exactly. Therefore \( (6, 2) \notin R \). Since \( (2, 6) \in R \) but \( (6, 2) \notin R \), the symmetry condition is violated. — Reason: This one concrete counterexample is enough to conclude that \( R \) is NOT symmetric.
  4. Step 4: Recall the definition of transitivity: \( R \) is transitive if whenever \( (x, y) \in R \) and \( (y, z) \in R \), it follows that \( (x, z) \in R \). In terms of divisibility this means: if \( x \) divides \( y \) and \( y \) divides \( z \), then \( x \) divides \( z \). — Reason: We now shift to testing the second property using its formal definition.
  5. Step 5: Prove transitivity in general. Suppose \( (x, y) \in R \) and \( (y, z) \in R \). Then there exist positive integers \( m \) and \( n \) such that \( y = m \cdot x \) and \( z = n \cdot y \). Substituting the first into the second gives \( z = n \cdot (m \cdot x) = (mn) \cdot x \). Since \( mn \) is a positive integer, \( x \) divides \( z \), so \( (x, z) \in R \). — Reason: Expressing divisibility algebraically lets us chain two divisibility facts into one, confirming transitivity holds universally.
  6. Step 6: Verify with a concrete example inside \( B \): take \( x = 1 \), \( y = 2 \), \( z = 4 \). We have \( (1, 2) \in R \) (since \( 1 \) divides \( 2 \)) and \( (2, 4) \in R \) (since \( 2 \) divides \( 4 \)). Then \( (1, 4) \in R \) (since \( 1 \) divides \( 4 \)). This matches the general argument. — Reason: A numerical check builds intuition and confirms the algebraic proof is consistent with actual pairs in \( R \).
  7. Step 7: Summarise both findings. The relation \( R \) fails symmetry because the counterexample \( (2, 6) \in R \) with \( (6, 2) \notin R \) shows the reverse pair need not belong to \( R \). The relation \( R \) satisfies transitivity because divisibility is a property that chains: if \( x \mid y \) and \( y \mid z \), then \( x \mid z \), which holds for all valid triples in \( B \). — Reason: Bringing both conclusions together gives a complete answer to the question.

Final Answer

R is not symmetric (for example \( (2, 6) \in R \) but \( (6, 2) \notin R \)), and R is transitive (if \( x \) divides \( y \) and \( y \) divides \( z \), then \( x \) divides \( z \)).

Common Mistake

One common mistake: students sometimes assume that because \( R \) contains pairs like \( (x, x) \) (e.g. \( (1,1) \), \( (2,2) \)), the relation might be symmetric overall — but symmetry must hold for every pair in \( R \), not just the diagonal ones, so a single non-symmetric pair like \( (2, 6) \) is enough to disprove it.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \ B = \{1,2,3,4,5,6\}, \quad R = \{(x,y) : x \mid y\}
  2. Step 2: Symmetry check: \ \( (2,6) \in R \) since \( 2 \mid 6 \), but \( 6 \nmid 2 \) so \( (6,2) \notin R \). Hence R is not symmetric.
  3. Step 3: Transitivity check: \( (x,y) \in R \) and \( (y,z) \in R \) means \( x \mid y \) and \( y \mid z \), which implies \( x \mid z \), so \( (x,z) \in R \). Hence R is transitive.

Answer: R is not symmetric (for example \( (2, 6) \in R \) but \( (6, 2) \notin R \)), and R is transitive (if \( x \) divides \( y \) and \( y \) divides \( z \), then \( x \) divides \( z \)).

➕ More Examples

More Examples

Example 1

Question: Two students Priya and Arjun are playing a number game. They use the set \( C = \{2, 4, 6, 8\} \). Define a relation \( R \) on \( C \) as \( R = \{(x, y) : x \text{ divides } y\} \). Check whether \( R \) is symmetric or transitive.

Solution: First, we list all pairs \( (x, y) \) in \( C \times C \) such that \( x \) divides \( y \). The set is \( C = \{2, 4, 6, 8\} \). Going through all pairs: \( 2 \mid 2 \), \( 2 \mid 4 \), \( 2 \mid 6 \), \( 2 \mid 8 \), \( 4 \mid 4 \), \( 4 \mid 8 \), \( 6 \mid 6 \), \( 8 \mid 8 \) So: \[ R = \{(2,2),(2,4),(2,6),(2,8),(4,4),(4,8),(6,6),(8,8)\} \] Checking Symmetry: For \( R \) to be symmetric, whenever \( (x, y) \in R \), we need \( (y, x) \in R \). Consider \( (2, 4) \in R \). This means 2 divides 4. For symmetry, we need \( (4, 2) \in R \), i.e., 4 must divide 2. But 4 does not divide 2. Since \( (2, 4) \in R \) but \( (4, 2) \notin R \), the relation \( R \) is NOT symmetric. Checking Transitivity: For \( R \) to be transitive, whenever \( (x, y) \in R \) and \( (y, z) \in R \), we need \( (x, z) \in R \). Take any pair \( (x, y) \in R \) and \( (y, z) \in R \). This means \( x \mid y \) and \( y \mid z \). If \( x \mid y \), then \( y = kx \) for some integer \( k \). If \( y \mid z \), then \( z = my \) for some integer \( m \). Therefore \( z = m \cdot kx = (mk)x \), so \( x \mid z \), which means \( (x, z) \in R \). Let us verify with an example from \( R \): \( (2, 4) \in R \) and \( (4, 8) \in R \). We check: is \( (2, 8) \in R \)? Yes, because \( 2 \mid 8 \). \( \checkmark \) Since the divisibility property is preserved in all such cases, \( R \) is transitive.

Answer: R is NOT symmetric (counterexample: \( (2,4) \in R \) but \( (4,2) \notin R \)). R IS transitive.

Example 2

Question: A teacher asks students to consider the set \( D = \{1, 2, 3, 4, 5\} \) of marks scored in a quiz. Define a relation \( R \) on \( D \) as \( R = \{(x, y) : x + y \le 6,\ x, y \in D\} \). Check whether \( R \) is symmetric or transitive.

Solution: We list all pairs \( (x, y) \) from \( D \times D \) such that \( x + y \le 6 \). \[ R = \{(1,1),(1,2),(1,3),(1,4),(1,5),(2,1),(2,2),(2,3),(2,4),(3,1),(3,2),(3,3),(4,1),(4,2),(5,1)\} \] Checking Symmetry: For \( R \) to be symmetric, whenever \( (x, y) \in R \), we need \( (y, x) \in R \). If \( (x, y) \in R \), then \( x + y \le 6 \). Since addition is commutative, \( y + x = x + y \le 6 \), so \( (y, x) \in R \) as well. This holds for every pair in \( R \). Therefore, \( R \) IS symmetric. Checking Transitivity: For \( R \) to be transitive, whenever \( (x, y) \in R \) and \( (y, z) \in R \), we need \( (x, z) \in R \). Consider \( (1, 5) \in R \) since \( 1 + 5 = 6 \le 6 \). Also, \( (5, 1) \in R \) since \( 5 + 1 = 6 \le 6 \). For transitivity, we need \( (1, 1) \in R \). Check: \( 1 + 1 = 2 \le 6 \). \( \checkmark \) Now try \( (3, 3) \in R \) since \( 3 + 3 = 6 \le 6 \). Also, \( (3, 3) \in R \). For transitivity, we need \( (3, 3) \in R \). Check: \( 3 + 3 = 6 \le 6 \). \( \checkmark \) Now try \( (4, 2) \in R \) since \( 4 + 2 = 6 \le 6 \). Also, \( (2, 4) \in R \) since \( 2 + 4 = 6 \le 6 \). For transitivity, we need \( (4, 4) \in R \). Check: \( 4 + 4 = 8 > 6 \). So \( (4, 4) \notin R \). Since \( (4, 2) \in R \) and \( (2, 4) \in R \) but \( (4, 4) \notin R \), the relation \( R \) is NOT transitive.

Answer: R IS symmetric (since \( x + y = y + x \)). R is NOT transitive (counterexample: \( (4,2) \in R \) and \( (2,4) \in R \) but \( (4,4) \notin R \)).

🎯 Try a Similar Question

Try a Similar Question

Question: Two students Arjun and Meera are playing a number game. They choose numbers from the set \( C = \{2, 3, 6, 12, 18\} \). A relation \( R \) on \( C \) is defined as \( R = \{(x, y) : x \text{ is a factor of } y\} \). Check whether \( R \) is symmetric and whether \( R \) is transitive.

Solution

  1. Step 1: Write out the relation R explicitly: We find all pairs \( (x, y) \) in \( C \times C \) such that \( x \) is a factor of \( y \). The set \( C = \{2, 3, 6, 12, 18\} \). Listing the pairs: \( (2, 2), (2, 6), (2, 12), (2, 18), (3, 3), (3, 6), (3, 12), (3, 18), (6, 6), (6, 12), (6, 18), (12, 12), (18, 18) \).
  2. Step 2: Check Symmetry: R is symmetric if for every \( (x, y) \in R \), we also have \( (y, x) \in R \). Consider the pair \( (2, 6) \in R \), since 2 is a factor of 6. For symmetry, we need \( (6, 2) \in R \), which means 6 must be a factor of 2. But 6 is NOT a factor of 2. Therefore \( (6, 2) \notin R \). Hence, R is NOT symmetric.
  3. Step 3: Check Transitivity: R is transitive if whenever \( (x, y) \in R \) and \( (y, z) \in R \), then \( (x, z) \in R \). Suppose \( x \) is a factor of \( y \) and \( y \) is a factor of \( z \). Then there exist integers \( m \) and \( n \) such that \( y = mx \) and \( z = ny \). Substituting, \( z = n(mx) = (mn)x \), so \( x \) is a factor of \( z \), meaning \( (x, z) \in R \). This holds for all such pairs in \( C \). For example, \( (2, 6) \in R \) and \( (6, 12) \in R \) implies \( (2, 12) \in R \), which is true since 2 is a factor of 12. Hence, R is transitive.
  4. Step 4: Conclusion: The relation \( R \) defined on \( C = \{2, 3, 6, 12, 18\} \) by \( x \) is a factor of \( y \) is NOT symmetric (since \( (2, 6) \in R \) but \( (6, 2) \notin R \)), and it IS transitive (if \( x \mid y \) and \( y \mid z \), then \( x \mid z \)).

Answer: R is NOT symmetric: for example, \( (2, 6) \in R \) but \( (6, 2) \notin R \) since 6 does not divide 2. R IS transitive: if \( x \) is a factor of \( y \) and \( y \) is a factor of \( z \), then \( x \) is necessarily a factor of \( z \).

Everything you get with Solver7

More questions in Relations and Functions