The Gateway to Computer Science Excellence
+15 votes
1.1k 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$
in Set Theory & Algebra by Veteran (52.3k points)
edited by | 1.1k views

3 Answers

+21 votes
Best answer
by Boss (33.9k points)
edited by
+2

Ref:

+9 votes
one to one mapping is permutations of m different thing out of n different thing..
P(n,m)
by Veteran (61k points)
+2 votes

Option B

by Boss (11.8k points)
edited by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,833 questions
57,713 answers
199,427 comments
107,660 users