To determine which statements are true, we'll analyze the functions , , and their compositions and .
Function Definitions:
:
:
Analysis of :
One-One (Injective):
For odd , . This is injective since each odd maps to a unique integer.
For even , . This is also injective since each even maps to a unique integer.
However, and , but and . Here, , so is not one-one.
Onto (Surjective):
For any , we can find such that :
If , take (odd).
If , take (even).
Thus, is onto.
Conclusion for :
Not one-one (since ).
Onto (as shown above).
This matches Statement (D).
Analysis of :
One-One (Injective):
For , . This is injective.
For , . This is also injective.
No overlaps between the two cases because for and for , with and . Thus, is one-one.
Onto (Surjective):
The range of for is .
The range of for is .
The number is not in the range of , so is not onto.
Conclusion for :
One-one (as shown above).
Not onto (since is not in the range).
This contradicts Statement (C).
Analysis of :
Compute for :
If is odd:
If is even:
If (i.e., ):
If (i.e., ):
Behavior of :
For odd , . This is injective but not surjective (e.g., , , etc., missing many natural numbers).
For even , (if ) or (if ). This is not injective (e.g., and both map to ) and not surjective.
Conclusion for :
Not one-one (due to overlaps like ).
Not onto (many natural numbers are not in the range).
This matches Statement (A).
Analysis of :
Compute for :
If :
Since is odd, .
If :
Since is even, .
Behavior of :
For , . This is injective.
For , . This is also injective.
The entire range covers all integers (from ) and all integers (from ), so is onto.
However, and , but , etc. There are no overlaps, so is one-one.
Conclusion for :
One-one (no overlaps in outputs).
Onto (covers all integers).
This contradicts Statement (B).
Final Answer:
The true statements are (A) and (D).
Answer:
Comments
Post a Comment