There are Two sets ,Set A{1,2,3,.......n} and Set B{ , .......... } .Assume a function to be a Set of bridge that associates each element of Set A to each element of Set B and no two brides can have same starting or end points, basically a one to one relation Every element of Set A and B has to be used. If , How many possible functions are there? In the image, 2 functions A and B are shown.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The problem boils down to Asking the number of ways to form Distinct String of ten letters using 10 Different Alphabets without repetition. So answer is 1 0 !