Let A = {1,2,3,4,...,n} be a set contain...

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

A

`2^(k)`

B

`2^(n-k)`

C

`2^(k+1)`

D

`2^(k-1)`

Verified by Experts

The correct Answer is:

D

There are `(k-1)`

Similar Questions

Explore conceptually related problems

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 containing n elements then find the number of subsets of A.

If a Set-A have 12 elements,then the number of subsets of A having atleast 3 elements is :

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

Let A and B two sets containing 2 and 4 elements respectively.the numberof subsets of AxB having three or more elements is

If A and B two sets containing 2 elements and 4 elements, respectively. Then, the number of subsets of A xx B having 3 or more elements, is

Let X be any non-empty set containing n elements. Then what is the number of relations on X ?