967 views

Let $A$ and $B$ be sets with cardinalities $m$ and $n$ respectively. The number of one-one mappings from $A$ to $B$, when $m < n$, is

1. $m^n$
2. $^nP_m$
3. $^mC_n$
4. $^nC_m$
5. $^mP_n$

edited | 967 views

by Boss (33.8k points)
edited
+1

Ref:

one to one mapping is permutations of m different thing out of n different thing..
P(n,m)
by Veteran (60.5k points)
+1 vote

Option B

by Boss (11.4k points)
edited