JEE Main 2021 Mathematics question — Cartesian products and counting relations
Let Z be the set of all integers, A={(x,y)∈Z×Z:(x−2)2+y2≤4} B={(x,y)∈Z×Z:x2+y2≤4} and C={(x,y)∈Z×Z:(x−2)2+(y−2)2≤4} If the total number of relations from A∩B to A∩C is 2p, then the value of p is:
SOLUTION
We begin by recalling that a relation from one set to another is simply a subset of the Cartesian product of the two sets. If the first set has m elements and the second has n elements, then the product has mn ordered pairs, and for every ordered pair we have a choice of either “include it in the relation’’ or “do not include it.’’ Hence the total number of possible relations is 2mn. In our problem we therefore need the sizes of the two intersections A∩B and A∩C. After that we will substitute them into the formula Number of relations =2∣A∩B∣∣A∩C∣.
The three sets are defined inside the lattice Z×Z by the following inequalities:
Set A is the collection of all integer points inside or on the circle of radius 2 centred at (2,0). Likewise, B is the radius-2 circle centred at the origin, and C is the radius-2 circle centred at (2,2).
Counting the points in A∩B. A point (x,y) must satisfy both
{(x−2)2+y2≤4,x2+y2≤4.
Because x2+y2≤4, the coordinate x can only be −2,−1,0,1,2. On the other hand, from (x−2)2+y2≤4 we have 0≤x≤4. Taking the intersection of these possibilities gives x∈{0,1,2}. We examine each value separately.
For x=0:
x2+y2≤4⇒y2≤4⇒y=−2,−1,0,1,2.(x−2)2+y2=(0−2)2+y2=4+y2≤4⇒y2≤0⇒y=0.
So only the point (0,0) remains.
For x=1:
x2+y2=1+y2≤4⇒y2≤3⇒y=−1,0,1.(x−2)2+y2=(1−2)2+y2=1+y2≤4⇒y=−1,0,1.
All three survive, giving the points (1,−1),(1,0),(1,1).
For x=2:
x2+y2=4+y2≤4⇒y2≤0⇒y=0.(x−2)2+y2=0+y2≤4⇒y=−2,−1,0,1,2.
The common value is y=0, so we get the single point (2,0).
Collecting everything,
∣A∩B∣=1+3+1=5.
Counting the points in A∩C. A point lies in both A and C precisely when
{(x−2)2+y2≤4,(x−2)2+(y−2)2≤4.
It is convenient to set u=x−2. Then u is an integer with u2≤4, so u∈{−2,−1,0,1,2}. In these new variables the inequalities become
{u2+y2≤4,u2+(y−2)2≤4.
For every fixed u write R=4−u2. Both squares must not exceed R, so we need simultaneously
∣y∣≤Rand∣y−2∣≤R.
For u=±2:u2=4⇒R=0.
Then y=0 from the first absolute-value condition and y=2 from the second, an impossibility. Hence no points occur for u=±2.
For u=±1:u2=1⇒R=3, R≈1.732.
First condition gives y=−1,0,1; second gives y−2=−1,0,1⇒y=1,2,3.
Their intersection is the single value y=1.
Thus we obtain the two points u=−1⇒x=1:(1,1) and u=1⇒x=3:(3,1).
For u=0:u2=0⇒R=4,R=2.
First condition yields y=−2,−1,0,1,2; second yields y=0,1,2,3,4.
The overlap is y=0,1,2.
These correspond to the three points (2,0),(2,1),(2,2).
Hence
∣A∩C∣=2+3=5.
Counting the relations. We have found
∣A∩B∣=5,∣A∩C∣=5.
The Cartesian product (A∩B)×(A∩C) therefore contains 5×5=25 ordered pairs. According to the formula stated at the start, the number of relations from A∩B to A∩C is
225.
Thus p=25. Among the given options, this matches Option A.
Hence, the correct answer is Option A.
Tagged Cartesian products and counting relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.