Let S be the set of all functions from the set A to the set A. If `n(A) = k` then `n(S)` is

The number of functions from the set A into the set B, when n(A) = 7 and n(B) = 5 is

Let S be the set of all function from the set {1, 2, …, 10} to itself. One function is selected from S, the probability that the selected function is one-one onto is :

Let S be the set of all function from the set {1, 2, …, 10} to itself. One function is selected from S, the probability that the selected function is one-one onto is :

Let A be a non-empty set and S be the set of all functions from A to itself. Prove that the composition of functions 'o' is a non-commutative binary operation on Sdot Also, prove that 'o' is an associative binary operation on Sdot

Let A be a non-empty set and S be the set of all functions from A to itself. Prove that the composition of functions 'o' is a non-commutative binary operation on Sdot Also, prove that 'o' is an associative binary operation on Sdot

If P(S) denotes the set of all subsets of a given set S, then the number of one-to-one functions from the set S={1,2,3} to the set P(S) is

If P(S) denotes the set of all subsets of a given set S, then the number of one-to-one functions from the set S= {1,2,3} to the set P(S) is

" If the number of bijective functions from a set "A" to set "B" is "120" ,then "n(A)+n(B)" is equal to "