If A is a finite set containing `n` elements then find the number of subsets of A.

Let A={1,2,3,4,...,n} be a set containing n elements,then for any given k<=n, the number of subsets of A having k as largest element must be

If A is a finite set with m elements then prove that the number of subsets is 2^(m)

If a set X contains n(n>5) elements,then what is the number of subsets of X containing less than 5 elements

If R is a relation from a finite set A having m elements to a finite set B having n elements then the number of relations from A to B is

If R is a relation on a finite set having n elements,then the number of relations on A is

A set has 4 elements,then total number of subsets is:

If R is a relation from a finite set A having m elements to a finite set B having n elements then the number of relations from A to B is 2^(mn) b.2^(mn)-1 c.. d.m^(n)

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