Please wait...
1800-212-7858 (Toll Free)
9:00am - 8:00pm IST all days
8104911739
For Business Enquiry

or

Thanks, You will receive a call shortly.
Customer Support

You are very important to us

For any content/service related issues please contact on this toll free number

022-62211530

Mon to Sat - 11 AM to 8 PM

Sir,how total number of proper subsets of every set with n elements is 2 to the power n-2?

Asked by sidhusid 18th May 2010, 7:14 AM
Answered by Expert
Answer:

this can be connected to the binimial theorem easily .

the subserts of a given set S may have 0 elements, 1 element, 2 elements....n elements.

so number of subsets will be

c(n,0), c(n,1)...c(n,n)

sum of all these will be the same as the expansion of (1+1) whole raised to power n, which is eequal to 2 raised to n

hence the answer.

Answered by Expert 18th May 2010, 12:20 PM
Rate this answer
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10

You have rated this answer /10

Your answer has been posted successfully!

Chat with us on WhatsApp