edited by
773 views

3 Answers

0 votes
0 votes

Answer will be (B)

Say 1 element from m element set choose 1 element from n element n ways

 Now, next element of m "          "        "        1      "           "      n element in (n-1) "

 "           "            "        "   "    "         "         "       1      "           "       n     "          "   (n-2) "

.......................................................................................................................

" when m=n "     "        "   "   "          "       "       1       "           "       n    "      "    1 ways 

(As we know max value of m could be n)

So,  total no of injective maps from a set of cardinality m to a set of cardinality n is =n.(n-1). (n-2). .....1=n!

0 votes
0 votes

No of injective functions from a set of cardinality m to a set o cardinality n----

 1.if m>=n there will be no injective function/mapping

2.if m<=n then no of injective map=nP{Special case if n=m then it is n!/m!}

So correct ans is D

Answer:

Related questions

2 votes
2 votes
1 answer
1
makhdoom ghaya asked Dec 9, 2015
414 views
The groups $Z_{9}$ and $Z_{3} \times Z_{3}$ are Isomorphic AbelianNon abelianCyclic
1 votes
1 votes
0 answers
2
makhdoom ghaya asked Dec 9, 2015
282 views
Suppose $f_{n}(x)$ is a sequence of continuous functions on the closed interval $[0, 1]$ converging to $0$ point wise. Then the integral $\int_{0}^{1} f_{n}(x) \text{d}x...
1 votes
1 votes
1 answer
3
makhdoom ghaya asked Dec 9, 2015
352 views
In the ring $\mathbb{Z}/8\mathbb{Z}$, the equation $x^{2}=1$ has exactly $2$ solutions.
1 votes
1 votes
0 answers
4
makhdoom ghaya asked Dec 9, 2015
311 views
The series$\sum_{n=1}^{\infty}\frac{\sqrt{n+1}-\sqrt{n}}{n}$diverges.