Sign in
12thPass logo
New chatPYQ LibraryDoubtsRank report
Sign in to see Recents

Your guest activity stays on this device

Sign in to save progress →
Sign in

Sets and Relations question

2025 · 8 Apr · Shift 2 · Q39
Guest · filters and generic practice availableBrowsing as a guest · PYQ filters and generic practice are available. Sign in only for personalised features and saved progress.
  1. PYQ Library
  2. /JEE Main
  3. /Mathematics
  4. /Sets and Relations
  5. /2025 · 8 Apr · Shift 2 · Q39

Sets and Relations question

2025 · 8 Apr · Shift 2 · Q39

JEE MainMathematicsSets and RelationsMCQ+4 / −1
Let A = {0, 1, 2, 3, 4, 5}. Let R be a relation on A defined by (x, y) ∈ R if and only if max{x, y} ∈ {3, 4}. Then among the statements (S1): The number of elements in R is 18, and (S2): The relation R is symmetric but neither reflexive nor transitive
  1. A
    both are false
  2. B
    only (S1) is true
  3. C
    only (S2) is true
  4. D
    both are true
View written solutionFree

Correct answer: C

  1. Given relation

We have A={0,1,2,3,4,5}A=\{0,1,2,3,4,5\}A={0,1,2,3,4,5} and (x,y)∈R  ⟺  max⁡{x,y}∈{3,4}.(x,y)\in R \iff \max\{x,y\}\in \{3,4\}.(x,y)∈R⟺max{x,y}∈{3,4}.

So an ordered pair (x,y)(x,y)(x,y) belongs to RRR exactly when the larger of xxx and yyy is either 333 or 444.


  1. Check statement (S1): number of elements in RRR

We count all ordered pairs (x,y)(x,y)(x,y) such that max⁡(x,y)=3\max(x,y)=3max(x,y)=3 or max⁡(x,y)=4\max(x,y)=4max(x,y)=4.

Case 1: max⁡(x,y)=3\max(x,y)=3max(x,y)=3

For this,

  • both x,y≤3x,y \le 3x,y≤3
  • and at least one of them must be 333

Possible pairs: (3,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,0),(3,1),(3,2),(3,3),(0,3),(1,3),(2,3)

That is 777 pairs.

(Equivalently: pairs from {0,1,2,3}2\{0,1,2,3\}^2{0,1,2,3}2 excluding those from {0,1,2}2\{0,1,2\}^2{0,1,2}2: 42−32=16−9=74^2-3^2=16-9=742−32=16−9=7)

Case 2: max⁡(x,y)=4\max(x,y)=4max(x,y)=4

For this,

  • both x,y≤4x,y \le 4x,y≤4
  • and at least one of them must be 444

Possible pairs: (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),(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)

That is 999 pairs.

(Equivalently: 52−42=25−16=95^2-4^2=25-16=952−42=25−16=9)

Total

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

So statement (S1): “The number of elements in RRR is 18” is false.


  1. Check statement (S2): symmetric, reflexive, transitive?

(i) Symmetric

Suppose (x,y)∈R(x,y)\in R(x,y)∈R. Then max⁡(x,y)∈{3,4}.\max(x,y)\in\{3,4\}.max(x,y)∈{3,4}. But max⁡(x,y)=max⁡(y,x),\max(x,y)=\max(y,x),max(x,y)=max(y,x), so max⁡(y,x)∈{3,4},\max(y,x)\in\{3,4\},max(y,x)∈{3,4}, which means (y,x)∈R.(y,x)\in R.(y,x)∈R.

Hence RRR is symmetric.


(ii) Reflexive

A relation on AAA is reflexive if (a,a)∈R(a,a)\in R(a,a)∈R for every a∈Aa\in Aa∈A.

Now (a,a)∈R  ⟺  max⁡(a,a)=a∈{3,4}.(a,a)\in R \iff \max(a,a)=a\in\{3,4\}.(a,a)∈R⟺max(a,a)=a∈{3,4}. So only (3,3)(3,3)(3,3) and (4,4)(4,4)(4,4) are in RRR.

But for example, (0,0)∉R,(1,1)∉R,(2,2)∉R,(5,5)∉R.(0,0)\notin R, \quad (1,1)\notin R, \quad (2,2)\notin R, \quad (5,5)\notin R.(0,0)∈/R,(1,1)∈/R,(2,2)∈/R,(5,5)∈/R.

Therefore RRR is not reflexive.


(iii) Transitive

A relation is transitive if (x,y)∈R and (y,z)∈R  ⟹  (x,z)∈R.(x,y)\in R \text{ and } (y,z)\in R \implies (x,z)\in R.(x,y)∈R and (y,z)∈R⟹(x,z)∈R.

We test by counterexample.

Take (0,3)∈R(0,3)\in R(0,3)∈R because max⁡(0,3)=3\max(0,3)=3max(0,3)=3, and (3,5)∉R(3,5)\notin R(3,5)∈/R so this won't help.

We need both first two pairs in RRR. Consider: (0,3)∈Rand(3,1)∈R(0,3)\in R \quad \text{and} \quad (3,1)\in R(0,3)∈Rand(3,1)∈R since max⁡(0,3)=3,max⁡(3,1)=3.\max(0,3)=3, \qquad \max(3,1)=3.max(0,3)=3,max(3,1)=3. Then transitivity would require (0,1)∈R.(0,1)\in R.(0,1)∈R. But max⁡(0,1)=1∉{3,4},\max(0,1)=1\notin\{3,4\},max(0,1)=1∈/{3,4}, so (0,1)∉R.(0,1)\notin R.(0,1)∈/R.

Hence RRR is not transitive.

So statement (S2): “The relation RRR is symmetric but neither reflexive nor transitive” is true.


  1. Final evaluation of options
  • (S1) is false
  • (S2) is true

Therefore the correct option is: C: only (S2) is true\boxed{\text{C: only (S2) is true}}C: only (S2) is true​


  1. Comparison with stored correct answer

Stored correct answer: C

Our derived answer: C

So they agree.

PreviousNext

More from Sets and Relations

  • Let A={1,2,3,…,10} and B={nm​:m,n∈A,m<n and gcd(m,n)=1}. Then n(B) is equal to :2025 · MCQ
  • The number of non-empty equivalence relations on the set {1,2,3} is :2025 · MCQ
  • Let A={1,2,3}. The number of relations on A, containing (1,2) and (2,3), which are reflexive and transitive but not symmetric, is ​.2025 · Numerical
  • Let R={(1,2),(2,3),(3,3)} be a relation defined on the set {1,2,3,4}. Then the minimum number of elements, needed to be added in R so that R becomes an equivalence relation, is:2025 · MCQ
  • Let X=R×R. Define a relation R on X as : (a1​,b1​)R(a2​,b2​)⇔b1​=b2​ Statement I: R is an equivalence relation. Statement II : For some (a,b)∈X…2025 · MCQ
  • Let A={(x,y)∈R×R:∣x+y∣⩾3} and B={(x,y)∈R×R:∣x∣+∣y∣≤3}. If C={(x,y)∈A∩B:x=0 or y=0}, then ∑(x,y)∈C​∣x+y∣…2025 · MCQ
  • Let S={p1​,p2​…,p10​} be the set of first ten prime numbers. Let A=S∪P, where P is the set of all possible products of distinct elements of S. Then the number of all ordered pairs (x,y),x∈S, y∈A…2025 · Numerical
  • Let A={x∈(0,π)−{2π​}:log(2/π)​∣sinx∣+log(2/π)​∣cosx∣=2} and B={x⩾0:x​(x​−4)−3∣x​−2∣+6=0}. Then n(A∪B)…2025 · MCQ