Consider the sets , , , and . The total number of one-one functions from the set to the set is:
- A
- B
- C
- D
Consider the sets , , , and . The total number of one-one functions from the set to the set is:
Correct answer:C
Standard Method
Given: , , , and .
Find: The total number of one-one functions from to .
First, find the number of elements in by solving the intersection of and :
Subtracting the first equation from the second,
so,
Then,
Counting Elements and Injective Functions
Hence the intersection points are
All four sign combinations are possible, so
Now count the integer points in .
Possible values are:
Therefore,
The number of one-one functions from a set of size to a set of size is
So the number of one-one functions from to is
Therefore, the correct option is C.
Counting the points of incorrectly by missing lattice points such as . This is wrong because all integer pairs satisfying must be included. List cases by values systematically.
Assuming the intersection has only points instead of . This is wrong because both coordinates can independently take positive and negative values once and are fixed. Count all sign combinations.
Using instead of permutations for one-one functions. This is wrong because injective mappings cannot assign the same image to two different elements of . Use instead.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.