Consider the sets , , , and . The total number of one-one functions from the set D to the set C is:
The set is the circle with radius centred at the origin: .
The set is the ellipse whose semi-axes are along the -axis and along the -axis.
To obtain we solve the two equations simultaneously.
From the circle, . Substitute into the ellipse:
, so .
Using ,
, hence .
Both and can take their signs independently, giving the four intersection points
Therefore, .
Next, count the elements of .
List all integer pairs inside or on the circle of radius :
• For : points.
• For : points.
• For : points.
Total: , so .
We need one-one (injective) functions from a -element set to a -element set . For an injective function, choose the image of each element of as follows:
• First element: choices.
• Second element: choices.
• Third element: choices.
• Fourth element: choices.
Hence the total number of injective functions is the permutation
Therefore, the required number of one-one functions is .
Option C is correct.
Tagged Cartesian products and counting relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.