A mapping is selected at random from the set of all mappings of the set into itself. The probability that mapping is bijective
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.
There is a set A = [ 1 , 2 , 3 , . . . . . n ] . Then all mapping from A to A can be given by n n (Total). Becasue for 1 there are n numbers which can be it's image, same for all n digits so all are multiplied hence n n . Now we know that for B i j e c t i v e it is one one + onto . That means that 1 will get any value in the s e t A = [ 1 , 2 , 3 . . . . . n ] . Or n values, Now 2 will get ( n − 1 ) values as 1 is used by 1 .Hence total bijective mapping is n ! . Now probability is n ! / n n