SOLVER7 Study. Nothing Else.
2026 Board Paper Q36(ii)

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\}.\)
Find whether R is reflexive or not.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Think about a rule that says 'y is divisible by x.' A relation is called reflexive when every element is paired with itself. Ask yourself: is any number divisible by itself? Yes, always! The number \( 3 \div 3 = 1 \), and \( 5 \div 5 = 1 \). Every number in the set \( B = \{1, 2, 3, 4, 5, 6\} \) divides itself perfectly. So every pair like \( (1,1) \), \( (2,2) \), and so on belongs to \( R \). That makes \( R \) reflexive.

Answer: Yes, \( R \) is reflexive, because every element \( x \in B \) is divisible by itself, so \( (x, x) \in R \) for all \( x \in B \).

📖 Checking Reflexivity of the Relation R

Detailed Explanation

A relation \( R \) on a set \( B \) is called reflexive if every element of the set is related to itself. In symbols, \( R \) is reflexive if \( (x, x) \in R \) for every \( x \in B \). Here the set is \( B = \{1, 2, 3, 4, 5, 6\} \) and the relation is \( R = \{(x, y) : y \text{ is divisible by } x\} \). So the pair \( (x, x) \) belongs to \( R \) only when \( x \) is divisible by \( x \). We must verify this for each element of \( B \).

Formula Used

A relation \( R \) on \( B \) is reflexive if \( (x, x) \in R \) for all \( x \in B \). Here \( (x, x) \in R \iff x \text{ is divisible by } x \).

Solution

  1. Step 1: Recall the definition of reflexive. The relation \( R \) is reflexive if for every element \( x \in B \), the pair \( (x, x) \) belongs to \( R \).
  2. Step 2: Apply the given rule to the pair \( (x, x) \). Since \( R = \{(x, y) : y \text{ is divisible by } x\} \), the pair \( (x, x) \in R \) means \( x \) must be divisible by \( x \).
  3. Step 3: Check divisibility of each element by itself. For any nonzero number, \( \frac{x}{x} = 1 \), which is a whole number. So every number is divisible by itself. Checking each element of \( B \): \( 1 \) divides \( 1 \), \( 2 \) divides \( 2 \), \( 3 \) divides \( 3 \), \( 4 \) divides \( 4 \), \( 5 \) divides \( 5 \), and \( 6 \) divides \( 6 \).
  4. Step 4: Conclude. Since \( (x, x) \in R \) for every \( x \in B \), the reflexive condition is satisfied for all elements. Therefore \( R \) is reflexive.

Final Answer

Yes, \( R \) is reflexive, because every element \( x \in B \) is divisible by itself, so \( (x, x) \in R \) for all \( x \in B \).

Common Mistake

A common mistake is to test only a few pairs like \( (2, 4) \) or \( (1, 6) \) and confuse divisibility of different elements with reflexivity. Reflexivity requires checking only the pairs of the form \( (x, x) \), not pairs of distinct elements.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and the relation. The set is \( B = \\{1, 2, 3, 4, 5, 6\\} \) and the relation is \( R = \\{(x, y) : y \text{ is divisible by } x\\} \). — Reason: Clearly stating what we are working with helps us know exactly what condition must be checked.
  2. Step 2: Write down the reflexivity condition. We need to check whether \( (x, x) \in R \) for every \( x \in B \). — Reason: The definition of a reflexive relation requires every element to be related to itself, so we focus on pairs of the form \( (x, x) \).
  3. Step 3: Translate the condition using the rule of \( R \). The pair \( (x, x) \in R \) if and only if \( x \) is divisible by \( x \). Since \( \frac{x}{x} = 1 \) for any nonzero \( x \), every element divides itself exactly. — Reason: Plugging \( y = x \) into the relation's rule converts an abstract condition into a simple arithmetic fact.
  4. Step 4: Verify each element of \( B \) individually. We check: \( 1 \mid 1 \), \( 2 \mid 2 \), \( 3 \mid 3 \), \( 4 \mid 4 \), \( 5 \mid 5 \), and \( 6 \mid 6 \). All six checks pass. — Reason: Confirming the condition element by element leaves no room for doubt and covers every case in \( B \).
  5. Step 5: Conclude reflexivity. Because \( (x, x) \in R \) holds for every \( x \in B \), the reflexivity condition is completely satisfied. — Reason: Once every element passes the self-divisibility test, we can confidently declare \( R \) is reflexive.

Final Answer

Yes, \( R \) is reflexive, because every element \( x \in B \) is divisible by itself, so \( (x, x) \in R \) for all \( x \in B \).

Common Mistake

One common mistake: Students sometimes confuse the order in the pair and check whether \( x \) divides \( y \) instead of whether \( y \) is divisible by \( x \) when \( y = x \), leading them to incorrectly doubt self-divisibility.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \( B = \{1, 2, 3, 4, 5, 6\} \), \( R = \{(x, y) : x \mid y\} \). Check \( (x, x) \in R \), i.e., \( x \mid x \).
  2. Step 2: For every nonzero \( x \), \( \frac{x}{x} = 1 \in \mathbb{Z} \), so \( x \mid x \) holds. Verified: \( 1 \mid 1,\ 2 \mid 2,\ 3 \mid 3,\ 4 \mid 4,\ 5 \mid 5,\ 6 \mid 6 \).
  3. Step 3: \( (x, x) \in R \) for all \( x \in B \). Hence \( R \) is reflexive.

Answer: Yes, \( R \) is reflexive, because every element \( x \in B \) is divisible by itself, so \( (x, x) \in R \) for all \( x \in B \).

➕ More Examples

More Examples

Example 1

Question: A group of students is playing a board game that uses a spinner with outcomes \( S = \{2, 3, 4, 6, 8, 12\} \). A relation \( R : S \to S \) is defined as \( R = \{(x, y) : x \text{ is a factor of } y\} \). Determine whether R is reflexive.

Solution: We need to check whether every element of \( S \) is related to itself under the given relation. That is, for each \( a \in S \), the pair \( (a, a) \) must satisfy the condition: a is a factor of a. Recall that any non-zero integer is always a factor of itself, since \( a \div a = 1 \), which is an integer with no remainder. Checking each element of \( S = \{2, 3, 4, 6, 8, 12\} \): For \( a = 2 \): Is 2 a factor of 2? Yes, since \( 2 = 2 \times 1 \). So \( (2, 2) \in R \). For \( a = 3 \): Is 3 a factor of 3? Yes, since \( 3 = 3 \times 1 \). So \( (3, 3) \in R \). For \( a = 4 \): Is 4 a factor of 4? Yes, since \( 4 = 4 \times 1 \). So \( (4, 4) \in R \). For \( a = 6 \): Is 6 a factor of 6? Yes. So \( (6, 6) \in R \). For \( a = 8 \): Is 8 a factor of 8? Yes. So \( (8, 8) \in R \). For \( a = 12 \): Is 12 a factor of 12? Yes. So \( (12, 12) \in R \). Since \( (a, a) \in R \) for every \( a \in S \), the relation R is reflexive.

Answer: R is reflexive, since every element of S is a factor of itself, so (a, a) belongs to R for all a in S.

Example 2

Question: In a mathematics classroom, a teacher assigns each student a number from the set \( T = \{1, 2, 3, 4, 5\} \). A relation \( R : T \to T \) is defined as \( R = \{(x, y) : x + y \text{ is an even number}\} \). Determine whether R is reflexive.

Solution: We need to check whether \( (a, a) \in R \) for every \( a \in T \). The condition requires that \( a + a \) is an even number. Now, for any element \( a \in T \), we compute \( a + a = 2a \). Since \( 2a \) is always a multiple of 2 for any integer \( a \), it is always even. Checking each element of \( T = \{1, 2, 3, 4, 5\} \): For \( a = 1 \): \( 1 + 1 = 2 \), which is even. So \( (1, 1) \in R \). For \( a = 2 \): \( 2 + 2 = 4 \), which is even. So \( (2, 2) \in R \). For \( a = 3 \): \( 3 + 3 = 6 \), which is even. So \( (3, 3) \in R \). For \( a = 4 \): \( 4 + 4 = 8 \), which is even. So \( (4, 4) \in R \). For \( a = 5 \): \( 5 + 5 = 10 \), which is even. So \( (5, 5) \in R \). In general, for any \( a \in T \): \[ a + a = 2a \] which is always even. Therefore \( (a, a) \in R \) for all \( a \in T \). Hence, R is reflexive.

Answer: R is reflexive, since for every a in T, a + a = 2a is always even, so (a, a) belongs to R for all a in T.

🎯 Try a Similar Question

Try a Similar Question

Question: Two students, Ananya and Karan, are playing a number game. They choose a set \( B = \{2, 4, 6, 8\} \). A relation \( R : B \to B \) is defined as \( R = \{(x, y) : x + y \text{ is odd}\} \). Determine whether \( R \) is reflexive or not. Justify your answer.

Solution

  1. Step 1: Recall the definition of a reflexive relation: A relation \( R \) on set \( B \) is reflexive if for every element \( x \in B \), the pair \( (x, x) \in R \). That means the condition defining \( R \) must hold when both components are the same element.
  2. Step 2: Identify the set B and the condition: Here \( B = \{2, 4, 6, 8\} \) and the condition for \( (x, y) \in R \) is that \( x + y \) must be odd.
  3. Step 3: Check the condition for each element paired with itself: For \( R \) to be reflexive, we need \( (x, x) \in R \) for all \( x \in B \), i.e., \( x + x \) must be odd for every \( x \in B \). Now, \( x + x = 2x \), which is always even for any integer \( x \).
  4. Step 4: Verify with specific elements: For \( x = 2 \): \( 2 + 2 = 4 \), which is even, so \( (2, 2) \notin R \). For \( x = 4 \): \( 4 + 4 = 8 \), which is even, so \( (4, 4) \notin R \). Similarly, \( (6, 6) \notin R \) and \( (8, 8) \notin R \), since \( 6 + 6 = 12 \) and \( 8 + 8 = 16 \) are both even.
  5. Step 5: Conclude: Since \( (x, x) \notin R \) for any \( x \in B \) (because \( x + x = 2x \) is always even, never odd), the relation \( R \) is NOT reflexive.

Answer: No, \( R \) is NOT reflexive. For any \( x \in B \), \( x + x = 2x \) is always even, so \( (x, x) \notin R \) for all \( x \in B = \{2, 4, 6, 8\} \). Hence, \( R \) fails the condition for reflexivity.

Everything you get with Solver7

More questions in Relations and Functions