The Gateway to Computer Science Excellence
0 votes
16 views

Suppose $X$ and $Y$ are finite sets, each with cardinality $n$.. The number of bijective functions from $X$ to $Y$ is

  1. $n^{n}$
  2. $n\log_{2}n$
  3. $n^{2}$
  4. $n!$
in Set Theory & Algebra by Boss (17.5k points)
recategorized by | 16 views
0
$n!$

1 Answer

0 votes

Answer $D$

The number of bijective functions are possible $\bf{only\;when}$ the number of elements in both the sets are same.

Its is given that the $X$ and $Y$ are the two sets each with cardinality $n$. $\therefore$ Number of elements are same.

Now, in set $X$

Number of choices for first element = $n$

Number of choices for second element = $n-1$

Number of choices for third element = $n-2$

$\vdots\;\;\;\vdots\;\;\;\vdots$

$\vdots\;\;\;\vdots\;\;\;\vdots$

$\vdots\;\;\;\vdots\;\;\;\vdots$

Number of choices for $(n-1)^{th}$ element = $2$

Number of choices for $n^{th}$ element = $1$

So, total choices are:

$$n(n-1)(n-2)(n-3)\dots\dots3.2.1 = n!$$

$\therefore D$ is the correct option.

 

by Boss (19k points)

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,737 questions
57,309 answers
198,338 comments
105,026 users