Download the app

Questions  

A set contains 2n+1 elements. The number of subsets of this set containing more than n elements is equal to

Unlock the full solution & master the concept.

Get a detailed solution and exclusive access to our masterclass to ensure you never miss a concept
By Expert Faculty of Sri Chaitanya
a
2n-1
b
2n
c
2n+1
d
22n

Ready to Test Your Skills?

Check Your Performance Today with our Free Mock Tests used by Toppers!

detailed solution

Correct option is D

Let the original set contains 2n+1 elements, then subsets of this set containing more than n elements, i.e., subsets containing n+1 elements, (n+2) elements, ....2n+1 elements.∴Required number of subsets=Cn+1   2n+1+Cn+2   2n+1+...+C2n   2n+1+C2n+1   2n+1=Cn   2n+1+Cn-1   2n+1+...+C1   2n+1+C0   2n+1=C0   2n+1+C1   2n+1+C2   2n+1+...+Cn-1   2n+1+Cn   2n+1=12[(1+1)2n+1] =1222n+1=22n.


Similar Questions

If X=8n-7n-1; nN and Y={49(n-1); nN}, then

Get your all doubts cleared from
Sri Chaitanya experts

counselling
india
+91

whats app icon
phone icon