Gujarat BoardEnglish MediumSTD 12 ScienceMathsFunctions3 Marks
Question
If A = {1, 2, 3}, show that a one-one function f : A → A must be onto.
✓
Answer
A = {1, 2, 3} Number of elements in A = 3 Number of one-one functions = number of ways of arranging 3 elements = 3! = 6 So, the possible one-one functions can be the following:
{(1, 1), (2, 2), (3, 3)}
{(1, 1), (2, 3), (3, 2)}
{(1, 2 ), (2, 2), (3, 3)}
{(1, 2), (2, 1), (3, 3)}
{(1, 3), (2, 2), (3, 1)}
{(1, 3), (2, 1), (3, 2)}
Here, in each function, range = {1, 2, 3}, which is same as the co-domain. So, all the functions are onto.
Need a full question paper?
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.