RankRizz
JEE MAIN 2025 · 04 APR S1+4 / −1HARDTRANSCRIBED

JEE Main 2025 Mathematics question — Cartesian products and counting relations

Consider the sets A={(x,y)∈R×R:x2+y2=25}A = \{(x, y) \in \mathbb{R} \times \mathbb{R} : x^2 + y^2 = 25\}, B={(x,y)∈R×R:x2+9y2=144}B = \{(x, y) \in \mathbb{R} \times \mathbb{R} : x^2 + 9y^2 = 144\}, C={(x,y)∈Z×Z:x2+y2≤4}C = \{(x, y) \in \mathbb{Z} \times \mathbb{Z} : x^2 + y^2 \le 4\}, and D=A∩BD = A \cap B. The total number of one-one functions from the set D to the set C is:

SOLUTION

The set AA is the circle with radius 55 centred at the origin: x2+y2=25x^2 + y^2 = 25.

The set BB is the ellipse x2+9y2=144x^2 + 9y^2 = 144 whose semi-axes are 1212 along the xx-axis and 44 along the yy-axis.

To obtain D=A∩BD = A \cap B we solve the two equations simultaneously.

From the circle, x2=25−y2x^2 = 25 - y^2 −(1)-(1). Substitute −(1)-(1) into the ellipse:

25−y2+9y2=14425 - y^2 + 9y^2 = 144

25+8y2=14425 + 8y^2 = 144

8y2=1198y^2 = 119

y2=1198y^2 = \frac{119}{8}, so y=±1198y = \pm \sqrt{\frac{119}{8}}.

Using −(1)-(1),

x2=25−1198=818x^2 = 25 - \frac{119}{8} = \frac{81}{8}, hence x=±818=±924x = \pm \sqrt{\frac{81}{8}} = \pm \frac{9\sqrt{2}}{4}.

Both xx and yy can take their signs independently, giving the four intersection points

(±924,  ±1198).\left(\pm\frac{9\sqrt{2}}{4}, \; \pm\sqrt{\frac{119}{8}}\right).

Therefore, ∣D∣=4|D| = 4.

Next, count the elements of C={(x,y)∈Z×Z:x2+y2≤4}C = \{(x, y) \in \mathbb{Z} \times \mathbb{Z} : x^2 + y^2 \le 4\}.

List all integer pairs inside or on the circle of radius 22:

• For y=0y = 0: x=−2,−1,0,1,2x = -2, -1, 0, 1, 2 →\rightarrow 55 points.
• For y=±1y = \pm 1: x2≤3x^2 \le 3 →\rightarrow x=−1,0,1x = -1, 0, 1 →\rightarrow 3+3=63 + 3 = 6 points.
• For y=±2y = \pm 2: x2≤0x^2 \le 0 →\rightarrow x=0x = 0 →\rightarrow 1+1=21 + 1 = 2 points.

Total: 5+6+2=135 + 6 + 2 = 13, so ∣C∣=13|C| = 13.

We need one-one (injective) functions from a 44-element set DD to a 1313-element set CC. For an injective function, choose the image of each element of DD as follows:

• First element: 1313 choices.
• Second element: 1212 choices.
• Third element: 1111 choices.
• Fourth element: 1010 choices.

Hence the total number of injective functions is the permutation

13×12×11×10=17160.13 \times 12 \times 11 \times 10 = 17160.

Therefore, the required number of one-one functions is 1716017160.

Option C is correct.

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

TopicCartesian products and counting relations
TypeMultiple choice