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

2024 · 6 Apr · Shift 2 · Q32
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. /2024 · 6 Apr · Shift 2 · Q32

Sets and Relations question

2024 · 6 Apr · Shift 2 · Q32

JEE MainMathematicsSets and RelationsMCQ+4 / −1
Let A={1,2,3,4,5}\mathrm{A}=\{1,2,3,4,5\}A={1,2,3,4,5}. Let R\mathrm{R}R be a relation on A\mathrm{A}A defined by xRyx \mathrm{R} yxRy if and only if 4x≤5y4 x \leq 5 \mathrm{y}4x≤5y. Let m\mathrm{m}m be the number of elements in R\mathrm{R}R and n\mathrm{n}n be the minimum number of elements from A×A\mathrm{A} \times \mathrm{A}A×A that are required to be added to R to make it a symmetric relation. Then m + n is equal to :
  1. A
    23
  2. B
    26
  3. C
    25
  4. D
    24
View written solutionFree

Correct answer: C

  1. Given relation

We have A={1,2,3,4,5}A=\{1,2,3,4,5\}A={1,2,3,4,5} and relation RRR on AAA defined by xRy  ⟺  4x≤5y.xRy \iff 4x\le 5y.xRy⟺4x≤5y.

We need:

  • m=m =m= number of ordered pairs in RRR
  • n=n =n= minimum number of ordered pairs to be added to make RRR symmetric
  • then compute m+nm+nm+n

  1. Find all pairs in RRR

For each fixed x∈Ax\in Ax∈A, we find all y∈Ay\in Ay∈A such that 4x≤5y  ⟺  y≥4x5.4x\le 5y \iff y\ge \frac{4x}{5}.4x≤5y⟺y≥54x​.

Let us check each xxx:

(i) x=1x=1x=1

4(1)=4,4≤5y4(1)=4,\quad 4\le 5y4(1)=4,4≤5y y≥45y\ge \frac45y≥54​ So all y∈{1,2,3,4,5}y\in\{1,2,3,4,5\}y∈{1,2,3,4,5} work.

Pairs: (1,1),(1,2),(1,3),(1,4),(1,5)(1,1),(1,2),(1,3),(1,4),(1,5)(1,1),(1,2),(1,3),(1,4),(1,5) Count = 5

(ii) x=2x=2x=2

4(2)=8,8≤5y4(2)=8,\quad 8\le 5y4(2)=8,8≤5y y≥85=1.6y\ge \frac85=1.6y≥58​=1.6 So y=2,3,4,5y=2,3,4,5y=2,3,4,5 work.

Pairs: (2,2),(2,3),(2,4),(2,5)(2,2),(2,3),(2,4),(2,5)(2,2),(2,3),(2,4),(2,5) Count = 4

(iii) x=3x=3x=3

4(3)=12,12≤5y4(3)=12,\quad 12\le 5y4(3)=12,12≤5y y≥125=2.4y\ge \frac{12}{5}=2.4y≥512​=2.4 So y=3,4,5y=3,4,5y=3,4,5 work.

Pairs: (3,3),(3,4),(3,5)(3,3),(3,4),(3,5)(3,3),(3,4),(3,5) Count = 3

(iv) x=4x=4x=4

4(4)=16,16≤5y4(4)=16,\quad 16\le 5y4(4)=16,16≤5y y≥165=3.2y\ge \frac{16}{5}=3.2y≥516​=3.2 So y=4,5y=4,5y=4,5 work.

Pairs: (4,4),(4,5)(4,4),(4,5)(4,4),(4,5) Count = 2

(v) x=5x=5x=5

4(5)=20,20≤5y4(5)=20,\quad 20\le 5y4(5)=20,20≤5y y≥4y\ge 4y≥4 So y=4,5y=4,5y=4,5 work.

Pairs: (5,4),(5,5)(5,4),(5,5)(5,4),(5,5) Count = 2

Therefore, m=5+4+3+2+2=16.m=5+4+3+2+2=16.m=5+4+3+2+2=16.


  1. Find minimum additions to make RRR symmetric

A relation is symmetric if whenever (x,y)∈R(x,y)\in R(x,y)∈R, then (y,x)∈R(y,x)\in R(y,x)∈R also.

So we list all pairs in RRR and check whether their reverse is already present.

Current relation: R={(1,1),(1,2),(1,3),(1,4),(1,5),(2,2),(2,3),(2,4),(2,5),(3,3),(3,4),(3,5),(4,4),(4,5),(5,4),(5,5)}R=\{(1,1),(1,2),(1,3),(1,4),(1,5),(2,2),(2,3),(2,4),(2,5),(3,3),(3,4),(3,5),(4,4),(4,5),(5,4),(5,5)\}R={(1,1),(1,2),(1,3),(1,4),(1,5),(2,2),(2,3),(2,4),(2,5),(3,3),(3,4),(3,5),(4,4),(4,5),(5,4),(5,5)}

Now check non-diagonal pairs:

  • (1,2)∈R(1,2)\in R(1,2)∈R, but (2,1)∉R(2,1)\notin R(2,1)∈/R ⇒\Rightarrow⇒ add (2,1)(2,1)(2,1)
  • (1,3)∈R(1,3)\in R(1,3)∈R, but (3,1)∉R(3,1)\notin R(3,1)∈/R ⇒\Rightarrow⇒ add (3,1)(3,1)(3,1)
  • (1,4)∈R(1,4)\in R(1,4)∈R, but (4,1)∉R(4,1)\notin R(4,1)∈/R ⇒\Rightarrow⇒ add (4,1)(4,1)(4,1)
  • (1,5)∈R(1,5)\in R(1,5)∈R, but (5,1)∉R(5,1)\notin R(5,1)∈/R ⇒\Rightarrow⇒ add (5,1)(5,1)(5,1)
  • (2,3)∈R(2,3)\in R(2,3)∈R, but (3,2)∉R(3,2)\notin R(3,2)∈/R ⇒\Rightarrow⇒ add (3,2)(3,2)(3,2)
  • (2,4)∈R(2,4)\in R(2,4)∈R, but (4,2)∉R(4,2)\notin R(4,2)∈/R ⇒\Rightarrow⇒ add (4,2)(4,2)(4,2)
  • (2,5)∈R(2,5)\in R(2,5)∈R, but (5,2)∉R(5,2)\notin R(5,2)∈/R ⇒\Rightarrow⇒ add (5,2)(5,2)(5,2)
  • (3,4)∈R(3,4)\in R(3,4)∈R, but (4,3)∉R(4,3)\notin R(4,3)∈/R ⇒\Rightarrow⇒ add (4,3)(4,3)(4,3)
  • (3,5)∈R(3,5)\in R(3,5)∈R, but (5,3)∉R(5,3)\notin R(5,3)∈/R ⇒\Rightarrow⇒ add (5,3)(5,3)(5,3)
  • (4,5)∈R(4,5)\in R(4,5)∈R, and (5,4)∈R(5,4)\in R(5,4)∈R already, so nothing needed.

Diagonal pairs (1,1),(2,2),…,(5,5)(1,1),(2,2),\dots,(5,5)(1,1),(2,2),…,(5,5) automatically satisfy symmetry.

Hence the minimum number of pairs to be added is n=9.n=9.n=9.


  1. Compute m+nm+nm+n

m+n=16+9=25.m+n=16+9=25.m+n=16+9=25.


  1. Check options

The correct option is: 25\boxed{25}25​ which is Option C.


  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={2,3,6,8,9,11} and B={1,4,5,10,15}. Let R be a relation on A×B defined by (a,b)R(c,d) if and only if 3ad−7bc is an even integer. Then the relation R is2024 · MCQ
  • Let A={2,3,6,7} and B={4,5,6,8}. Let R be a relation defined on A×B by (a1​,b1​)R(a2​,b2​) if and only if a1​+a2​=b1​+b2​. Then the number of elements in R is ​.2024 · Numerical
  • Let S={1,2,3,…,10}. Suppose M is the set of all the subsets of S, then the relation R={(A,B):A∩Beqϕ;A,B∈M} is :2024 · MCQ
  • Let A and B be two finite sets with m and n elements respectively. The total number of subsets of the set A is 56 more than the total number of subsets of B. Then the distance of the point P(m,n) from the point Q(−2,−3) is…2024 · MCQ
  • Let R be a relation on Z×Z defined by (a,b)R(c,d) if and only if ad−bc is divisible by 5. Then R is2024 · MCQ
  • If R is the smallest equivalence relation on the set {1,2,3,4} such that {(1,2),(1,3)}⊂R, then the number of elements in R is ​.2024 · MCQ
  • The number of symmetric relations defined on the set {1,2,3,4} which are not reflexive is ​.2024 · Numerical
  • Let A={1,2,3,4} and R={(1,2),(2,3),(1,4)} be a relation on A. Let S be the equivalence relation on A such that R⊂S and the number of elements in S is n. Then, the…2024 · Numerical