If `n(A)=n(B)=3`, then how many bijective functions from A to B can be formed?

If n(A)=3 and n(B)=4 , then no. of of one-one function from A to B is :

The number of bijective functions from A to B if n(A)=n(B)=4

Set A has m distinct elements and set B has n distinct elements. Then how many different mappings from set A to set B can be formed?

Set A has m distinct elements and set B has n distinct elements. Then how many different mappings from set A to set B can be formed?

Set A has m distinct elements and set B has n distinct elements. Then how many different mappings from set A to set B can be formed?

Let n(A)=4,n(B)=4. Find number of possible bijective functions from A to B .

Let A contain n distinct numbers.How many bijections from A to A can be defined?

If A , B are two sets such that n(A)=100, n(B)=150 , then the number of bijections from A onto B is