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 · 9 Apr · Shift 1 · Q51
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 · 9 Apr · Shift 1 · Q51

Sets and Relations question

2024 · 9 Apr · Shift 1 · Q51

JEE MainMathematicsSets and RelationsNumerical+4 / −1
Let A={2,3,6,7}A=\{2,3,6,7\}A={2,3,6,7} and B={4,5,6,8}B=\{4,5,6,8\}B={4,5,6,8}. Let RRR be a relation defined on A×BA \times BA×B by (a1,b1)R(a2,b2)(a_1, b_1) R(a_2, b_2)(a1​,b1​)R(a2​,b2​) if and only if a1+a2=b1+b2a_1+a_2=b_1+b_2a1​+a2​=b1​+b2​. Then the number of elements in RRR is ‾\underline{\hspace{2cm}}​.
Numerical answer
View written solutionFree

Correct answer: 25

  1. We need to count the number of ordered pairs ((a1,b1),(a2,b2))∈(A×B)×(A×B)((a_1,b_1),(a_2,b_2)) \in (A\times B)\times (A\times B)((a1​,b1​),(a2​,b2​))∈(A×B)×(A×B) for which a1+a2=b1+b2.a_1+a_2=b_1+b_2.a1​+a2​=b1​+b2​.

Equivalently, a1−b1=b2−a2=−(a2−b2),a_1-b_1 = b_2-a_2 = -(a_2-b_2),a1​−b1​=b2​−a2​=−(a2​−b2​), so it is easiest to group elements of A×BA\times BA×B by the value of a−ba-ba−b.

  1. First list all pairs in A×BA\times BA×B and compute a−ba-ba−b.

Given A={2,3,6,7},B={4,5,6,8}.A=\{2,3,6,7\},\qquad B=\{4,5,6,8\}.A={2,3,6,7},B={4,5,6,8}.

All 161616 pairs (a,b)(a,b)(a,b) are:

  • For a=2a=2a=2: (2,4):−2, (2,5):−3, (2,6):−4, (2,8):−6(2,4): -2,\ (2,5): -3,\ (2,6): -4,\ (2,8): -6(2,4):−2, (2,5):−3, (2,6):−4, (2,8):−6
  • For a=3a=3a=3: (3,4):−1, (3,5):−2, (3,6):−3, (3,8):−5(3,4): -1,\ (3,5): -2,\ (3,6): -3,\ (3,8): -5(3,4):−1, (3,5):−2, (3,6):−3, (3,8):−5
  • For a=6a=6a=6: (6,4):2, (6,5):1, (6,6):0, (6,8):−2(6,4): 2,\ (6,5): 1,\ (6,6): 0,\ (6,8): -2(6,4):2, (6,5):1, (6,6):0, (6,8):−2
  • For a=7a=7a=7: (7,4):3, (7,5):2, (7,6):1, (7,8):−1(7,4): 3,\ (7,5): 2,\ (7,6): 1,\ (7,8): -1(7,4):3, (7,5):2, (7,6):1, (7,8):−1
  1. Count frequency of each value of a−ba-ba−b.

From the above table:

a−bfrequency−61−51−41−32−23−1201122231\begin{array}{c|c} a-b & \text{frequency} \\\hline -6 & 1\\ -5 & 1\\ -4 & 1\\ -3 & 2\\ -2 & 3\\ -1 & 2\\ 0 & 1\\ 1 & 2\\ 2 & 2\\ 3 & 1 \end{array}a−b−6−5−4−3−2−10123​frequency1112321221​​
  1. Condition for relation.

For two elements (a1,b1)(a_1,b_1)(a1​,b1​) and (a2,b2)(a_2,b_2)(a2​,b2​), a1+a2=b1+b2a_1+a_2=b_1+b_2a1​+a2​=b1​+b2​ iff a1−b1=−(a2−b2).a_1-b_1 = -(a_2-b_2).a1​−b1​=−(a2​−b2​).

So if a value d=a−bd=a-bd=a−b occurs f(d)f(d)f(d) times, then it contributes f(d) f(−d)f(d)\,f(-d)f(d)f(−d) ordered pairs to the relation.

Thus total number of elements in RRR is ∑df(d)f(−d).\sum_d f(d)f(-d).∑d​f(d)f(−d).

  1. Compute the total.

Using the table:

  • d=−6d=-6d=−6: f(−6)f(6)=1⋅0=0f(-6)f(6)=1\cdot 0=0f(−6)f(6)=1⋅0=0
  • d=−5d=-5d=−5: 1⋅0=01\cdot 0=01⋅0=0
  • d=−4d=-4d=−4: 1⋅0=01\cdot 0=01⋅0=0
  • d=−3d=-3d=−3: 2⋅1=22\cdot 1=22⋅1=2
  • d=−2d=-2d=−2: 3⋅2=63\cdot 2=63⋅2=6
  • d=−1d=-1d=−1: 2⋅2=42\cdot 2=42⋅2=4
  • d=0d=0d=0: 1⋅1=11\cdot 1=11⋅1=1
  • d=1d=1d=1: 2⋅2=42\cdot 2=42⋅2=4
  • d=2d=2d=2: 2⋅3=62\cdot 3=62⋅3=6
  • d=3d=3d=3: 1⋅2=21\cdot 2=21⋅2=2

Adding, 0+0+0+2+6+4+1+4+6+2=25.0+0+0+2+6+4+1+4+6+2=25.0+0+0+2+6+4+1+4+6+2=25.

Hence, ∣R∣=25.|R|=25.∣R∣=25.

  1. Comparison with stored answer.

Stored correct answer = 252525. Our derived answer also equals 252525, so they agree.

PreviousNext

More from Sets and Relations

  • 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
  • Let A={1,2,3,…………,100}. Let R be a relation on A defined by (x,y)∈R if and only if 2x=3y. Let R1​ be a symmetric relation on A such that R⊂R1​ and the number of elements in…2024 · Numerical
  • Let R be a relation on R, given by R={(a,b):3a−3b+7​ is an irrational number }. Then R is2023 · MCQ