Probabilty + Permutations + Functions

A mapping is selected at random from the set of all mappings of the set A = [ 1 , 2 , 3...... n ] A = [1,2,3......n] into itself. The probability that mapping is bijective

1 / n n 1/n^n 1 / n ! 1/n! n ! / n n n!/n^n n ! / 2 n n!/2^n

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.

1 solution

Md Zuhair
Oct 5, 2016

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

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...