If $|A| = 5$ and $ |B| =25$ , how many functions from $A$ to $B$ are injective?
I'm not quite sure how to tackle this problem as I do not quite understand what $|A| = 5$ and $|B| = 25$ means .
If $|A| = 5$ and $ |B| =25$ , how many functions from $A$ to $B$ are injective?
I'm not quite sure how to tackle this problem as I do not quite understand what $|A| = 5$ and $|B| = 25$ means .
The number of injective maps from $A$ to $B$ is $n!\times \binom{m}{n}$ with $m = |B|, n = |A|$. In your case, it's $5!\times \binom{25}{5}$.