RankRizz
JEE MAIN 2026 · 05 APR S2+4 / −1HARDTRANSCRIBED

JEE Main 2026 Mathematics question — Cartesian products and counting relations

Let A={1,4,7}A = \{1, 4, 7\} and B={2,3,8}B = \{2, 3, 8\}.  Then the number of elements, in the relation R={((a1,b1),(a2,b2))∈(A×B)×(A×B):a1+b2 divides a2+b1}R = \{((a_1, b_1), (a_2, b_2)) \in (A \times B) \times (A \times B) : a_1 + b_2 \text{ divides } a_2 + b_1\}. is :

SOLUTION

The set of ordered pairs is A×B={(1,2),(1,3),(1,8),(4,2),(4,3),(4,8),(7,2),(7,3),(7,8)}A \times B = \{(1,2),(1,3),(1,8),(4,2),(4,3),(4,8),(7,2),(7,3),(7,8)\}, so there are 99 elements in A×BA \times B.

The relation RR is defined on (A×B)×(A×B)(A \times B) \times (A \times B) by
((a1,b1),(a2,b2))∈R  ⟺  a1+b2 divides a2+b1.((a_1,b_1),(a_2,b_2)) \in R \iff a_1+b_2 \text{ divides } a_2+b_1.
Thus we have to count all ordered quadruples (a1,b1,a2,b2)(a_1,b_1,a_2,b_2) with this divisibility property.

Let d=a1+b2d = a_1+b_2 (the divisor) and n=a2+b1n = a_2+b_1 (the dividend).
For every choice of (a1,b2)(a_1,b_2) we get one value of dd, and for every independent choice of (a2,b1)(a_2,b_1) we get one value of nn. Hence

∣R∣=∑d∣n(number of ways to obtain d)×(number of ways to obtain n).|R| = \sum_{d|n} (\text{number of ways to obtain } d)\times(\text{number of ways to obtain } n).

Compute all possible sums and their frequencies:

ab=2b=3b=8134946712791015\begin{array}{c|ccc} a & b=2 & b=3 & b=8\\\hline 1 & 3 & 4 & 9\\ 4 & 6 & 7 & 12\\ 7 & 9 & 10 & 15 \end{array}

The multiset of sums and their counts is
{3(1), 4(1), 6(1), 7(1), 9(2), 10(1), 12(1), 15(1)}.\{3(1),\,4(1),\,6(1),\,7(1),\,9(2),\,10(1),\,12(1),\,15(1)\}. (The number in parentheses is the frequency.)
Because the same table holds for both (a1,b2)(a_1,b_2) and (a2,b1)(a_2,b_1), the divisor and dividend distributions are identical.

List every possible divisor dd, determine which dividends nn it divides, and accumulate the contributions:

dn that satisfy d∣nContribution=cd∑cn33,6,9,12,151(1+1+2+1+1)=644,121(1+1)=266,121(1+1)=2771(1)=1992(2)=410101(1)=112121(1)=115151(1)=1\begin{array}{c|c|c} d & n\text{ that satisfy }d|n & \text{Contribution}=c_d\sum c_n\\\hline 3 & 3,6,9,12,15 & 1(1+1+2+1+1)=6\\ 4 & 4,12 & 1(1+1)=2\\ 6 & 6,12 & 1(1+1)=2\\ 7 & 7 & 1(1)=1\\ 9 & 9 & 2(2)=4\\ 10 & 10 & 1(1)=1\\ 12 & 12 & 1(1)=1\\ 15 & 15 & 1(1)=1 \end{array}

Adding all contributions:
∣R∣=6+2+2+1+4+1+1+1=18.|R| = 6+2+2+1+4+1+1+1 = 18.

Therefore, the required cardinality is 18.

Tagged Cartesian products and counting relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicCartesian products and counting relations
TypeNumerical answer