MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Empty Set

The total num...

Question

The total number of injective mapping from a finite set with m elements to a set with n elements for m > n is______.

Open in App

Solution

If $m > n,$ the elements of $B$ are exhausted be fore we have assigned
on image to each element of $A .$
Thus there is no injective mapping from $A$ to $B$

Suggest Corrections

thumbs-up

0

Similar questions

Q. The total number of injective mappings from a set with

m

elements to a set with

n

m \leq n,

Q. Let A and B be two sets with a finite number of elements. Assume that there is injective mapping from A to B and that there is an injective mapping from B to A. Prove that there is a bijective mapping from A to B.

Q. Let A and B be two sets, each with a finite number of elements. Assume that there is an injective map from A to B and that there is an injective map from B to A. Prove that there is a bijection from A to B.

A

B

be two finite sets having

m

n

elements respectively. Then the total number of mapping from

A

B

A

B

be two finite sets having

m

n

elements respectively such that

m \leq n

. A mapping is selected at random from the set of all mappings from

A

B

. The probability that the mapping selected is an injection, is

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Standard XII Mathematics

Join BYJU'S Learning Program

CrossIcon