If n(A)=n(B),then f is bijection from A to B
Answers
Answered by
2
Answer:
A bijection from A to B is a function which maps every element of A to unique element of B i.e. injective.
⟹n(B)≥n(A)
Also, it ensures that every element of B is an image of some element of A
i
is a bijection.
Any and all images of some fixed a
i
Hence, the number of functions is exactly equal to the number of such permutations, which
Correct option is {m/2}!
Similar questions