• edited by
5,880 views
7 7 votes

Let $\text{A}$ be a finite set having $x$ elements and let $\text{B}$ be a finite set having $y$ elements. What is the number of distinct functions mapping $\text{B}$ into $\text{A}$.

  1. $x^y$
  2. $2^{(x+y)}$
  3. $y^x$
  4. $y! / (y-x)!$

2 Answers

Best answer
14 14 votes

Set A have x elements and B set have y elements. Each elements in B has x choices to be mapped to and being a function it must map to some element.Since each element has exactly x choices,

The total number of functions from B to A =$\underbrace{x\times x\times x\times\cdots \times x }_{y \text{ times}} \\ = x^y.$

Hence, Option(A) xy is the correct choice.


For example we can consider $A = \{1\}$ and $B=\{1, 2\}$. Now, only possible function from $B \to A$ is

  1. $\{ (1,1), (2,1)\}$
• edited by
1 1 vote

Answer : C 

I don't think this Answer need an Explanation 

Answer:
Position:
Show:

Related questions

85 85 votes
9 answers 9 answers
19.9k
19.9k views
go_editor asked Sep 28, 2014
19,943 views
Let ܵ$S$ denote the set of all functions $f:\{0,1\}^4 \to \{0,1\}$. Denote by $N$ the number of functions from S to the set $\{0,1\}$. The value of $ \log_2 \log_2N $ is ...
12 12 votes
9 answers 9 answers
24.3k
24.3k views
ajit asked Sep 23, 2015
24,288 views
How many different trees are there with four nodes $\text{A, B, C}$ and $\text{D}?$$30$$60$$90$$120$
12 12 votes
2 answers 2 answers
12.5k
12.5k views
ajit asked Sep 2, 2015
12,501 views
The number of bit strings of length $8$ that will either start with $1$ or end with $00$ is?$32$ $128$ $160$ $192$
25 25 votes
4 answers 4 answers
11.2k
11.2k views
Kathleen asked Sep 25, 2014
11,175 views
The number of functions from an $m$ element set to an $n$ element set is$m + n$$m^n$$n^m$$m*n$