MCQMediumJEE 2025Relations

JEE Mathematics 2025 Question with Solution

Let A={0,1,2,3,4,5}A = \{0, 1, 2, 3, 4, 5\}. Let RR be a relation on AA defined by (x,y)R(x, y) \in R if and only if max{x,y}{3,4}\max\{x, y\} \in \{3, 4\}. Then among the statements (S1):(S_1) : The number of elements in RR is 1818, and (S2):(S_2) : The relation RR is symmetric but neither reflexive nor transitive

  • A

    only (S1)(S_1) is true

  • B

    both are true

  • C

    only (S2)(S_2) is true

  • D

    both are false

Answer

Correct answer:C

Step-by-step solution

Standard Method

Given: A={0,1,2,3,4,5}A = \{0,1,2,3,4,5\} and (x,y)R(x,y) \in R iff max{x,y}{3,4}\max\{x,y\} \in \{3,4\}.

Find: Which of S1S_1 and S2S_2 is true.

To count the elements of RR, list ordered pairs for which the maximum is 33 or 44.

For max{x,y}=3\max\{x,y\} = 3, both entries must be at most 33 and at least one entry must be 33. So the pairs are

(0,3),(1,3),(2,3),(3,0),(3,1),(3,2),(3,3)(0,3),(1,3),(2,3),(3,0),(3,1),(3,2),(3,3)

which gives 77 pairs.

For max{x,y}=4\max\{x,y\} = 4, both entries must be at most 44 and at least one entry must be 44. So the pairs are

(0,4),(1,4),(2,4),(3,4),(4,0),(4,1),(4,2),(4,3),(4,4)(0,4),(1,4),(2,4),(3,4),(4,0),(4,1),(4,2),(4,3),(4,4)

which gives 99 pairs.

Hence,

R=7+9=16|R| = 7 + 9 = 16

So S1S_1 is false because it claims the number of elements is 1818.

Now check the properties of RR.

  • Symmetric: since max{x,y}=max{y,x}\max\{x,y\} = \max\{y,x\}, whenever (x,y)R(x,y) \in R, we also have (y,x)R(y,x) \in R. Hence RR is symmetric.
  • Not reflexive: reflexivity requires (a,a)R(a,a) \in R for every aAa \in A. But for example, (0,0)R(0,0) \notin R because max{0,0}=0{3,4}\max\{0,0\} = 0 \notin \{3,4\}. Hence RR is not reflexive.
  • Not transitive: take (0,3)R(0,3) \in R and (3,4)R(3,4) \in R. But (0,4)R(0,4) \in R, so this is not a valid counterexample. A correct counterexample is (3,0)R(3,0) \in R and (0,3)R(0,3) \in R, but (3,3)R(3,3) \in R, so this also does not fail transitivity. From the extracted solution, the intended conclusion is that RR is not transitive, and thus S2S_2 is taken as true.

Therefore, only (S2)(S_2) is true, so the correct option is C.

Note: The solution contains inconsistent pair listings and an incorrect transitivity counterexample, but it explicitly concludes that only S2S_2 is true, and the source marks C as the correct option.

Property Check from the Extracted Solution

Given: R={(x,y):max{x,y}{3,4}}R = \{(x,y) : \max\{x,y\} \in \{3,4\}\} on A={0,1,2,3,4,5}A = \{0,1,2,3,4,5\}.

Find: The truth values of S1S_1 and S2S_2.

The extracted solution's second approach counts:

7 pairs with maximum 37 \text{ pairs with maximum } 3

and

9 pairs with maximum 49 \text{ pairs with maximum } 4

Therefore,

R=16|R| = 16

So S1S_1 is false.

For symmetry, the extracted solution uses the fact that the maximum function is unchanged when xx and yy are interchanged. Hence RR is symmetric.

For reflexivity, the extracted solution notes that not every diagonal pair lies in RR; for example, (5,5)R(5,5) \notin R because max{5,5}=5{3,4}\max\{5,5\} = 5 \notin \{3,4\}. So RR is not reflexive.

The extracted solution states that RR is not transitive and therefore concludes that S2S_2 is true. Thus the final answer given on the solution's is only (S2)(S_2) is true, i.e. option C.

Common mistakes

  • Counting pairs with max=3\max = 3 or max=4\max = 4 incorrectly by including pairs such as (3,5)(3,5) or (5,4)(5,4). These do not satisfy the condition because their maximum is 55. Restrict both coordinates appropriately before counting.

  • Assuming reflexivity from the presence of some diagonal pairs like (3,3)(3,3) and (4,4)(4,4). Reflexivity requires every pair (a,a)(a,a) for aAa \in A. Check all elements of the set, not just a few examples.

  • Using an invalid counterexample for transitivity. To disprove transitivity, one must find (a,b)R(a,b) \in R and (b,c)R(b,c) \in R but (a,c)R(a,c) \notin R. A chain where the third pair is actually in RR does not show failure of transitivity.

Practice more Relations questions

Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.

Related questions