If A is a finite set containing n elements, then number of proper subsets of A is

Let A be a finite set containing n distinct elements. The number of relations that can be defined from A to A is (a) 2^n (b) n^2 (c) 2^(n^2) (d) None of these

Let A be a finite set containing n distinct elements. The number of functions that can defined from A to A is

A set contain n elements, then power set contains:

If S is a finite set having n elements , then the total number of commutative binary operations S is :

Two finite sets have m and n elements. The total number of subsets of the first set is 48 more than the total number of subsets of the second set. The value of m - n is

Two finite sets have m and n elements. The total number of subsets of the first set is 56 more than the total number of subsets of the second set. Find the values of m and n.

Two finite sets have m and n elements. The number of subsets of the first set is 112 more than that of the second set. The values of m and are, respectively :