in Set Theory & Algebra recategorized by
4,404 views
28 votes
28 votes

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 recategorized by
4.4k views

3 Answers

31 votes
31 votes
Best answer
edited by

1 comment

Ref:

13
13
12 votes
12 votes
one to one mapping is permutations of m different thing out of n different thing..
P(n,m)
5 votes
5 votes

Option B

edited by
Answer:

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