$A$ and $B$ are finite sets. How many Partial Functions exist between them? so I have following question
$A$ and $B$ are finite sets
How many Partial Functions exist between them ?
$f:A\to B$
Can someone give me a solution/hint/website where they may explain me a solution.
Since unfortunately I can't think of a good solution for this one.
 A: Another solution is to identify a partial function $f$ from $A$ to $B$ with a total function from $A$ to the disjoint union $B \sqcup \{\ast\}$ (send every element not in the domain of $f$ to $\ast$). The number of such total functions is $(|B| +1)^{|A|}$, just as in Bernard's solution. 
A: A partial function from $A$ to $B$ is a map from a subset $X$ of $A$ to $B$. If this subset has $k$ elements $(0\le k\le \lvert B\,\lvert)$, there are $\lvert B\,\lvert^{k}$ such maps. In addition, there are $\dbinom{\lvert A\,\lvert}k$ such subsets.
It remains to sum over all possible values for $kk$:
$$\sum_{k=0}^{\lvert A\,\lvert}\dbinom{\lvert A\,\lvert}k \lvert B\,\lvert^{k}=\bigl(1+\lvert B\,\lvert\bigr)^{\lvert A\,\lvert}.$$
A: Hope this interpretation is correct and makes it more simple, straight and intuitive:

In partial function, every element in $A$ need not have image in codomain $B$. Thus each element in $A$ will have $(|B|+1)$ ($+1$ for not mapping to any of the elements in $B$) choices. So total number of partial functions from $A$ to $B$
$ = \underbrace{(|B|+1) (|B|+1)… (|B|+1)}_{\text{|A| times}} = (|B|+1)^{|A|}$

A: Answer: (|B|+1)^|A|
You can come to the answer (|B|+1)^|A| pretty quickly by just imagining that B had an extra element as bottom, and then just calculate the number of functions from A to {B + bottom} and you will find this will be equivalent to the number of partial functions. This is because we just imagine that mapping to bottom equates to being not mapped by the partial function.
