The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+10 votes
595 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$
asked in Set Theory & Algebra by Veteran (59.5k points)
edited by | 595 views

3 Answers

+16 votes
Best answer
answered by Boss (34k points)
edited by
+1

Ref:

+7 votes
one to one mapping is permutations of m different thing out of n different thing..
P(n,m)
answered by Veteran (55.4k points)
–1 vote

Answer is nPm

answered by Loyal (6.7k points)


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

39,440 questions
46,623 answers
139,377 comments
57,026 users